On monotonicity and boundedness properties of linear multistep methods
Open Access
- 17 November 2005
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (254) , 655-672
- https://doi.org/10.1090/s0025-5718-05-01794-1
Abstract
In this paper an analysis is provided of nonlinear monotonicity and boundedness properties for linear multistep methods. Instead of strict monotonicity for arbitrary starting values we shall focus on generalized monotonicity or boundedness with Runge-Kutta starting procedures. This allows many multistep methods of practical interest to be included in the theory. In a related manner, we also consider contractivity and stability in arbitrary norms.Keywords
This publication has 17 references indexed in Scilit:
- On monotonicity and boundedness properties of linear multistep methodsMathematics of Computation, 2005
- Stepsize restrictions for total-variation-boundedness in general Runge–Kutta proceduresApplied Numerical Mathematics, 2005
- Monotonicity-Preserving Linear Multistep MethodsSIAM Journal on Numerical Analysis, 2003
- Strong Stability-Preserving High-Order Time Discretization MethodsSIAM Review, 2001
- Contractivity-Preserving Implicit Linear Multistep MethodsMathematics of Computation, 1991
- TVB Uniformly High-Order Schemes for Conservation LawsMathematics of Computation, 1987
- Circle contractive linear multistep methodsBIT Numerical Mathematics, 1986
- Contractivity in the numerical solution of initial value problemsNumerische Mathematik, 1983
- Nonlinear stability behaviour of linear multistep methodsBIT Numerical Mathematics, 1983
- Stability of explicit time discretizations for solving initial value problemsNumerische Mathematik, 1981