Computable explicit bounds for the discretization error of variable stepsize multistep methods
DOI10.1016/S0898-1221(00)00130-9zbMath0959.65095MaRDI QIDQ1569972
José-Luis Morera, Gregorio Rubio, Lucas Jodar
Publication date: 16 April 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
stability; initial value problem; multistep methods; computable error bound; Dahlquist's root condition; variable stepsize method
34A34: Nonlinear ordinary differential equations and systems
65L20: Stability and convergence of numerical methods for ordinary differential equations
65L05: Numerical methods for initial value problems involving ordinary differential equations
65L06: Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations
65L70: Error bounds for numerical methods for ordinary differential equations
65L50: Mesh generation, refinement, and adaptive methods for ordinary differential equations
Related Items
Cites Work
- Stability of multistep-methods on variable grids
- An error analysis of Householder's method for the symmetric eigenvalue problem
- Extensions of the Predictor-corrector Method for the Solution of Systems of ordinary Differential Equations
- The Convergence of Variable-Stepsize, Variable-Formula, Multistep Methods
- Construction of Variable-Stepsize Multistep Formulas
- The Effect of Variable Mesh Size on the Stability of Multistep Methods
- Stability and Convergence of Variable Order Multistep Methods
- Algorithms for Changing the Step Size
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item