A new view of the computational complexity of IVP for ODE

DOI10.1023/A:1021108323034zbMath1020.65037OpenAlexW1667785455MaRDI QIDQ1862219

Robert M. Corless

Publication date: 10 March 2003

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021108323034

zbMATH Keywords

computational complexityinitial value problemadaptive step-size controlHölder mean

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Complexity and performance of numerical algorithms (65Y20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Related Items (5)

Computational complexity of solving polynomial differential equations over unbounded domains ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ Adaptivity and computational complexity in the numerical solution of ODEs ⋮ Polynomial cost for solving IVP for high-index DAE ⋮ Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time

This page was built for publication: A new view of the computational complexity of IVP for ODE