Computational complexity of solving polynomial differential equations over unbounded domains

DOI10.1016/j.tcs.2016.02.002zbMath1416.65197arXiv1409.0451OpenAlexW1933685207MaRDI QIDQ264572

Amaury Pouly, Daniel Silva Graça

Publication date: 31 March 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityordinary differential equationsadaptive Taylor algorithmscomputation with real numbers

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Characterizing time computational complexity classes with polynomial differential equations ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ Computing the exact number of periodic orbits for planar flows ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables ⋮ A Universal Ordinary Differential Equation ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computability of Differential Equations

Uses Software

• TIDES
• Taylor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breaking the limits: The Taylor series method
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Adaptivity and computational complexity in the numerical solution of ODEs
• Computational complexity of one-step methods for a scalar autonomous differential equation
• A new view of the computational complexity of IVP for ODE
• Explicit a-priori error bounds and adaptive error control for approximation of nonlinear initial value differential systems
• Computability with polynomial differential equations
• Church's thesis meets the \(N\)-body problem
• Algorithm 924
• A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Solving Ordinary Differential Equations Using Taylor Series
• AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
• On the complexity of solving initial value problems

This page was built for publication: Computational complexity of solving polynomial differential equations over unbounded domains