Stability of numerical methods for ordinary differential equations

DOI10.1023/A:1021108006254zbMath1016.65059OpenAlexW1522407833MaRDI QIDQ1862214

A. D. Heard, John C. Butcher

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:1021108006254

zbMATH Keywords

initial value problemsBDF methodsvariable stepsizebackward differentiation formula methodmultivalue methods

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Related Items

General linear method: A survey ⋮ Linearly Implicit Multistep Methods for Time Integration ⋮ On the zero-stability of multistep methods on smooth nonuniform grids ⋮ Scale and modify for the second and third order BDF methods ⋮ A priori error estimation in terms of the third derivative for the method of successive approximations applied to ODE's ⋮ Third-order paired explicit Runge-Kutta schemes for stiff systems of equations ⋮ The dichotomy of stiffness: Pragmatism versus theory ⋮ Efficiently implementable multivalue methods for solving stiff ordinary differential equations ⋮ Optimal explicit Runge-Kutta time stepping for density-based finite-volume solvers ⋮ Optimal Runge-Kutta stability polynomials for multidimensional high-order methods ⋮ Differential algebraic equations with properly stated leading terms ⋮ Time-step selection algorithms: adaptivity, control, and signal processing