Starting BDF and Adams codes at optimal order

DOI10.1016/0377-0427(88)90319-6zbMath0642.65056OpenAlexW2070347583MaRDI QIDQ1101186

R. W. Brankin, Lawrence F. Shampine, Ian Gladwell

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90319-6

zbMATH Keywords

numerical examplesstiff problemsbackward difference formulaAdams multistep codesoptimal order and step sizeRunge- Kutta formulasstarting codes

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (4)

The starting procedure in variable-stepsize variable-order PECE codes ⋮ A comparison of preconditioners in the solution of parabolic systems in three space dimensions using DASPK and a high order finite element method ⋮ DELSOL -- a numerical code for the solution of systems of delay- differential equations ⋮ Software based on explicit RK formulas

Uses Software

• IMSL Numerical Libraries
• DEPAC

Cites Work

• Starting variable-order Adams and BDF codes
• Starting step size for an ODE solver
• Automatic selection of the initial step size for an ODE solver
• Interpolation for Runge–Kutta Methods
• Some Practical Runge-Kutta Formulas
• Natural Continuous Extensions of Runge-Kutta Methods
• Practical Aspects of Interpolation in Runge-Kutta Codes
• Runge-Kutta Starters for Multistep Methods
• Comparing numerical methods for stiff systems of O.D.E:s
• Interpolants for Runge-Kutta formulas
• The automatic integration of ordinary differential equations

This page was built for publication: Starting BDF and Adams codes at optimal order