TY - GEN
T1 - Solving analytic differential equations in polynomial time over unbounded domains
AU - Bournez, Olivier
AU - Graça, Daniel S.
AU - Pouly, Amaury
PY - 2011/9/1
Y1 - 2011/9/1
N2 - In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of ℝn and ℂn, under the Computable Analysis setting. 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 to the complex plane.
AB - In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of ℝn and ℂn, under the Computable Analysis setting. 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 to the complex plane.
UR - https://www.scopus.com/pages/publications/80052111907
U2 - 10.1007/978-3-642-22993-0_18
DO - 10.1007/978-3-642-22993-0_18
M3 - Conference contribution
AN - SCOPUS:80052111907
SN - 9783642229923
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 170
EP - 181
BT - Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings
T2 - 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011
Y2 - 22 August 2011 through 26 August 2011
ER -