Stepsize restrictions for boundedness and monotonicity of multistep methods
DOI10.1007/s10915-011-9487-1zbMath1261.65084OpenAlexW2136165012MaRDI QIDQ421333
A. Mozartova, Marc N. Spijker, Willem H. Hundsdorfer
Publication date: 23 May 2012
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/16707
boundednessnumerical examplesinitial value problemmethod of lineslinear multistep methodstotal-variation-diminishingnonlinear monotonicityRunge-Kutta starting proceduresstepsize coefficientstrong-stability-preservingtotal-variation-bounded
Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) 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)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High order strong stability preserving time discretizations
- Special boundedness properties in numerical initial value problems
- Nonlinear stability behaviour of linear multistep methods
- Circle contractive linear multistep methods
- Contractivity preserving explicit linear multistep methods
- Contractivity in the numerical solution of initial value problems
- IMEX extensions of linear multistep methods with general monotonicity and boundedness properties
- High-order linear multistep methods with general monotonicity and boundedness properties
- Strong Stability-Preserving High-Order Time Discretization Methods
- Computation of optimal monotonicity preserving general linear methods
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
- Solving Ordinary Differential Equations I
- Contractivity-Preserving Implicit Linear Multistep Methods
- On monotonicity and boundedness properties of linear multistep methods
- Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
- Total-Variation-Diminishing Time Discretizations
- Conservation de la positivité lors de la discrétisation des problèmes d'évolution paraboliques
- Monotonicity-Preserving Linear Multistep Methods
- An extension and analysis of the Shu-Osher representation of Runge-Kutta methods
- Representations of Runge--Kutta Methods and Strong Stability Preserving Methods