An algorithm for starting multistep methods.

DOI10.1016/S0898-1221(03)80011-1zbMath1035.65077OpenAlexW1981183876MaRDI QIDQ1416377

R. Tirani, C. Paracelli

Publication date: 14 December 2003

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)80011-1

zbMATH Keywords

convergencenumerical examplespredictor-corrector methodInitial value problemsAdams-Bashforth-Moulton PECE pairstarting multistep 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)

Related Items (1)

Up to sixth-order accurate A-stable implicit schemes applied to the discontinuous Galerkin discretized Navier-Stokes equations

Uses Software

• NSDTST
• STDTST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differentiable Interpolants for High-Order Runge–Kutta Methods
• Global Error Estimates for ODE<scp>s</scp> Based on Extrapolation Methods
• ODE solvers and the method of lines
• Interpolants for Runge-Kutta formulas
• Two FORTRAN packages for assessing initial value methods
• On the Numerical Integration of Certain Differential Equations of the Second Order
• Order Barriers for Continuous Explicit Runge-Kutta Methods

This page was built for publication: An algorithm for starting multistep methods.