Convergence proofs for numerical IVP software

MaRDI QIDQ4945809zbMATH OpenFDO

Authors Harbir Lamba, A. M. Stuart

Publication date 21 August 2000

zbMATH Keywords

adaptive softwareaverage-caseconvergenceerror controlrandom algorithmsrunning times of algorithmsstepsize controltolerance proportionalityworst-case

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Stability and convergence of numerical methods for ordinary differential equations (65L20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Error bounds for numerical methods for ordinary differential equations (65L70) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Probabilistic and deterministic convergence proofs for software for initial value problems
• On average case errors in numerical analysis
• The randomized complexity of initial value problems
• A new view of the computational complexity of IVP for ODE
• Probabilistic analysis of algorithms

Cited in

(3)

• Convergence results for the MATLAB ode23 routine
• Probabilistic and deterministic convergence proofs for software for initial value problems
• scientific article; zbMATH DE number 1984158 (Why is no real title available?)

Describes a project that uses

Uses Software

• ode23

This page was built for publication: Convergence proofs for numerical IVP software

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