Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

On the complexity of solving polynomial initial value problems

Abstract : In this paper we prove that computing the solution of an initial-value problem $\dot{y}=p(y)$ with initial condition $y(t_0)=y_0\in\R^d$ at time $t_0+T$ with precision $e^{-\mu}$ where $p$ is a vector of polynomials can be done in time polynomial in the value of $T$, $\mu$ and $Y=\sup_{t_0\leqslant u\leqslant T}\infnorm{y(u)}$. Contrary to existing results, our algorithm works for any vector of polynomials $p$ over any bounded or unbounded domain and has a guaranteed complexity and precision. In particular we do not assume $p$ to be fixed, nor the solution to lie in a compact domain, nor we assume that $p$ has a Lipschitz constant.
Document type :
Conference papers
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal-polytechnique.archives-ouvertes.fr/hal-00760742
Contributor : Olivier Bournez Connect in order to contact the contributor
Submitted on : Tuesday, December 4, 2012 - 1:00:20 PM
Last modification on : Friday, May 13, 2022 - 10:18:05 PM
Long-term archiving on: : Saturday, December 17, 2016 - 7:55:53 PM

File

complexity_solving_pivp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00760742, version 1

Collections

Citation

Olivier Bournez, Daniel Graça, Amaury Pouly. On the complexity of solving polynomial initial value problems. International Symposium on Symbolic and Algebraic Computation (ISSAC'12), 2012, France. ⟨hal-00760742⟩

Share

Metrics

Record views

97

Files downloads

76