Abstract
We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.
| Original language | English |
|---|---|
| Pages (from-to) | 25-44 |
| Number of pages | 20 |
| Journal | Applicable Algebra in Engineering, Communication and Computing |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 1998 |
Keywords
- Algorithm
- Asymptotic expansion
- Exp-log function
- Genericity