Convergence of linear multistep and one-leg methods for stiff nonlinear initial value problems
Publication:758135
DOI10.1007/BF01952789zbMath0724.65071MaRDI QIDQ758135
B. I. Steininger, Willem H. Hundsdorfer
Publication date: 1991
Published in: BIT (Search for Journal in Brave)
linear multistep methodsorders of convergencevariable stepsizeone-leg methodsGlobal error boundsstiff nonlinear initial value problems
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Multiple scale methods for ordinary differential equations (34E13)
Related Items (12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of B-convergence of Runge-Kutta methods
- Matrix valued versions of a result of von Neumann with an application to time discretization
- B-convergence of the implicit midpoint rule and the trapezoidal rule
- Error of Runge-Kutta methods for stiff problems studied via differential algebraic equations
- Choices in contractivity theory
- Contractivity in the numerical solution of initial value problems
- Stability of Two-Step Methods for Variable Integration Steps
- G-stability is equivalent toA-stability
- On One-Leg Multistep Methods
- Stability Properties of Implicit Runge–Kutta Methods
- Multiplier techniques for linear multistep methods
- Contractive methods for stiff differential equations part I
This page was built for publication: Convergence of linear multistep and one-leg methods for stiff nonlinear initial value problems