On the complexity of solving initial value problems

Abstract

In this paper we prove that computing the solution of an initial-value problem y = <i>p</i>(<i>y</i>) with initial condition <i>y</i>(<i>t</i><sub>0</sub>) = <i>y</i><sub>0</sub> &#8712; R<sup><i>d</i></sup> at time <i>t</i><sub>0</sub> + <i>T</i> with precision 2<sup>&minus;&mu;</sup> where <i>p</i> is a vector of polynomials can be done in time polynomial… (More)
DOI: 10.1145/2442829.2442849

Topics

Cite this paper

@inproceedings{Bournez2012OnTC, title={On the complexity of solving initial value problems}, author={Olivier Bournez and Daniel S. Graça and Amaury Pouly}, booktitle={ISSAC}, year={2012} }