On the complexity of solving initial value problems

DOI10.1145/2442829.2442849zbMath1323.68312arXiv1202.4407OpenAlexW2053544268MaRDI QIDQ5244524

Amaury Pouly, Olivier Bournez, Daniel Silva Graça

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4407

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12)

Related Items (9)

Computational complexity of solving polynomial differential equations over unbounded domains ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ On the functions generated by the general purpose analog computer ⋮ Computing the exact number of periodic orbits for planar flows ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Average-case polynomial-time computability of hamiltonian dynamics ⋮ Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer ⋮ A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method ⋮ Computability of Differential Equations

This page was built for publication: On the complexity of solving initial value problems