The step sizes used by one-step codes for ODEs
From MaRDI portal
Publication:801643
DOI10.1016/0168-9274(85)90030-3zbMath0552.65058OpenAlexW1978589520WikidataQ127941065 ScholiaQ127941065MaRDI QIDQ801643
Publication date: 1985
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(85)90030-3
Numerical methods for initial value problems involving ordinary differential equations (65L05) Software, source code, etc. for problems pertaining to ordinary differential equations (34-04)
Related Items (8)
On the zero-stability of multistep methods on smooth nonuniform grids ⋮ A simple step size selection algorithm for ODE codes ⋮ Global error estimation with one-step methods ⋮ Error estimation and control for ODEs ⋮ Variable order Adams codes. ⋮ Nordsieck representation of two-step Runge-Kutta methods for ordinary differential equations ⋮ Software based on explicit RK formulas ⋮ Local error estimation by doubling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order and stepsize control in extrapolation methods
- Starting step size for an ODE solver
- The art of writing a Runge-Kutta code. II
- Local error control in codes for ordinary differential equations
- Initial Value Routines in the NAG Library
- On Testing a Subroutine for the Numerical Integration of Ordinary Differential Equations
- Solving Nonstiff Ordinary Differential Equations—The State of the Art
- A Theoretical Criterion for Comparing Runge–Kutta Formulas
- The automatic integration of ordinary differential equations
- Comparing Numerical Methods for Ordinary Differential Equations
- Comparing Error Estimators for Runge-Kutta Methods
This page was built for publication: The step sizes used by one-step codes for ODEs