Abstract
We give an algorithm to compute asymptotic expansions of exp-log functions. This algorithm automatically computes the necessary asymptotic scale and does not suffer from problems of indefinite cancellation. In particular, an asymptotic equivalent can always be computed for a given exp-log function.
| Original language | English |
|---|---|
| Pages | 309-313 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 1 Jan 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC 96 - Zurich, Switz Duration: 24 Jul 1996 → 26 Jul 1996 |
Conference
| Conference | Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISSAC 96 |
|---|---|
| City | Zurich, Switz |
| Period | 24/07/96 → 26/07/96 |
Fingerprint
Dive into the research topics of 'Asymptotic expansions of exp-log functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver