Rigorous numerical computation of polynomial differential equations over unbounded domains

DOI10.1007/978-3-319-32859-1_40zbMATH Open1460.65088OpenAlexW2468463561MaRDI QIDQ2807868FDOQ2807868

Authors: Amaury Pouly, Olivier Bournez, Daniel Graça 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_40

Recommendations

• On the complexity of solving initial value problems
• Computational complexity of solving polynomial differential equations over unbounded domains
• Solving analytic differential equations in polynomial time over unbounded domains
• Computational bounds on polynomial differential equations
• scientific article; zbMATH DE number 1569211

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cited In (5)

• Computational complexity of solving polynomial differential equations over unbounded domains
• On the complexity of solving initial value problems
• Computational bounds on polynomial differential equations
• Solving analytic differential equations in polynomial time over unbounded domains
• Polynomial interpolation and a priori bootstrap for computer-assisted proofs in nonlinear ODEs

This page was built for publication: Rigorous numerical computation of polynomial differential equations over unbounded domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807868)