# Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

Abstract : In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains in $\R^n$ and $\C^n$. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension over a strip on the complex plane.
Document type :
Conference papers

Cited literature [22 references]

https://hal-polytechnique.archives-ouvertes.fr/hal-00760919
Contributor : Olivier Bournez <>
Submitted on : Tuesday, December 4, 2012 - 3:31:10 PM
Last modification on : Thursday, March 5, 2020 - 6:26:41 PM
Long-term archiving on: : Tuesday, March 5, 2013 - 3:52:55 AM

### File

analyticMFCS.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00760919, version 1

### Citation

Olivier Bournez, Daniel Graça, Amaury Pouly. Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. Mathematical Foundations of Computer Science, MFCS'11, 2011, Poland. pp.170-181. ⟨hal-00760919⟩

Record views