The computational complexity of extrapolation methods

DOI10.1007/S11786-007-0040-4MaRDI QIDQ626884zbMATH OpenOpenAlexFDO

Authors Silvana Ilie, Robert M. Corless, Chris Essex

Publication date 19 February 2011

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0040-4

zbMATH Keywords

adaptive step-size controlextrapolationHölder meaninitial value problemsordinary differential equations

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient Extrapolation Methods for ODEs
• A new view of the computational complexity of IVP for ODE
• Recent Progress in Extrapolation Methods for Ordinary Differential Equations
• scientific article; zbMATH DE number 2068695
• scientific article; zbMATH DE number 3860316

Cited in

(1)

• Experiments with range computations using extrapolation

This page was built for publication: The computational complexity of extrapolation methods

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