A new view of the computational complexity of IVP for ODE

DOI10.1023/A:1021108323034MaRDI QIDQ1862219zbMATH OpenOpenAlexFDO

Authors 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

adaptive step-size controlcomputational complexityHölder meaninitial value problem

Mathematics Subject Classification ID

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

Review text

The author shows that to solve an initial value problem (IVP) to a given accuracy adaptive step-size control is never theoretically more costly than fixed step-size control and can be less costly by an unbounded factor.

Recommendations

• On the complexity of solving initial value problems
• Computability of ordinary differential equations
• Optimal solution of ordinary differential equations
• Adaptivity and computational complexity in the numerical solution of ODEs
• The randomized complexity of initial value problems

Cited in

(13)

• Some recent advances in validated methods for IVPs for ODEs
• Computability of ordinary differential equations
• Polynomial cost for solving IVP for high-index DAE
• Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
• Computational complexity of solving polynomial differential equations over unbounded domains
• An adaptive stepsize algorithm for the numerical solving of initial-value problems
• scientific article; zbMATH DE number 1424560 (Why is no real title available?)
• On the complexity of solving initial value problems
• Computability and computational complexity of the evolution of nonlinear dynamical systems
• The computational complexity of extrapolation methods
• An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation
• Adaptivity and computational complexity in the numerical solution of ODEs
• A procedure with stepsize control for solving \(n\) one-dimensional IVPs

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

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