The step sizes used by one-step codes for ODEs
From MaRDI portal
(Redirected from Publication:801643)
Recommendations
Cites work
- scientific article; zbMATH DE number 3541848 (Why is no real title available?)
- scientific article; zbMATH DE number 3633701 (Why is no real title available?)
- scientific article; zbMATH DE number 3804778 (Why is no real title available?)
- scientific article; zbMATH DE number 3420157 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- A Theoretical Criterion for Comparing Runge–Kutta Formulas
- Comparing Error Estimators for Runge-Kutta Methods
- Comparing Numerical Methods for Ordinary Differential Equations
- Initial Value Routines in the NAG Library
- Local error control in codes for ordinary differential equations
- On Testing a Subroutine for the Numerical Integration of Ordinary Differential Equations
- Order and stepsize control in extrapolation methods
- Solving Nonstiff Ordinary Differential Equations—The State of the Art
- Starting step size for an ODE solver
- The art of writing a Runge-Kutta code. II
- The automatic integration of ordinary differential equations
Cited in
(10)- Nordsieck representation of two-step Runge-Kutta methods for ordinary differential equations
- Software based on explicit RK formulas
- Global error estimation with one-step methods
- Stepsize selection for ordinary differential equations
- Elementary differentials, their graphs and codes
- Local error estimation by doubling
- On the zero-stability of multistep methods on smooth nonuniform grids
- Variable order Adams codes.
- A simple step size selection algorithm for ODE codes
- Error estimation and control for ODEs
This page was built for publication: The step sizes used by one-step codes for ODEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801643)