We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower degree. More precisely, we derive degree bounding formulas which allow to estimate the degree of the output equations of creative telescoping as a function of the order. As an application, we show how the knowledge of this formula can be used to optimize the runtime of creative telescoping implementations, and we deduce bounds on the asymptotic complexity of creative telescoping for hyperexponential terms.
| Originalsprache | Englisch |
|---|
| Seitenumfang | 31 |
|---|
| Publikationsstatus | Veröffentlicht - 2011 |
|---|
| Name | arXiv.org |
|---|
| Nr. | 1108.4508 |
|---|
- 101001 Algebra
- 101002 Analysis
- 101 Mathematik
- 102 Informatik
- 102011 Formale Sprachen
- 101009 Geometrie
- 101013 Mathematische Logik
- 101020 Technische Mathematik
- 101025 Zahlentheorie
- 101012 Kombinatorik
- 101005 Computeralgebra
- 101006 Differentialgeometrie
- 101003 Angewandte Geometrie
- 102025 Verteilte Systeme
- Computation in Informatics and Mathematics