Contractivity preserving explicit linear multistep methods

DOI10.1007/BF01406515zbMath0649.65043OpenAlexW2046439391MaRDI QIDQ1105991

H. W. J. Lenferink

Publication date: 1989

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133352

zbMATH Keywords

systemscontractivityexplicit linear multistep methodsmaximal stepsizeoptimal multistep methods

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Related Items (27)

Efficient Stability-Preserving Numerical Methods for Nonlinear Coercive Problems in Vector Space ⋮ IMEX extensions of linear multistep methods with general monotonicity and boundedness properties ⋮ Contractivity preserving explicit linear multistep methods ⋮ Efficient inequality-preserving integrators for differential equations satisfying forward Euler conditions ⋮ A numerical study of diagonally split Runge-Kutta methods for PDEs with discontinuities ⋮ Multirate explicit Adams methods for time integration of conservation laws ⋮ High order strong stability preserving time discretizations ⋮ Explicit strong stability preserving multistep Runge–Kutta methods ⋮ Strong stability preserving multistep schemes for forward backward stochastic differential equations ⋮ Temporal high-order, unconditionally maximum-principle-preserving integrating factor multi-step methods for Allen-Cahn-type parabolic equations ⋮ Strong-stability-preserving 3-stage Hermite-Birkhoff time-discretization methods ⋮ Strong stability preserving Runge-Kutta and linear multistep methods ⋮ Stepsize restrictions for boundedness and monotonicity of multistep methods ⋮ ODE-Based Multistep Schemes for Backward Stochastic Differential Equations ⋮ Numerical integration of positive linear differential-algebraic systems ⋮ Contractivity of Runge-Kutta methods ⋮ Strong-stability-preserving additive linear multistep methods ⋮ A Polynomial Formulation of Adaptive Strong Stability Preserving Multistep Methods ⋮ High-order linear multistep methods with general monotonicity and boundedness properties ⋮ Computation of optimal monotonicity preserving general linear methods ⋮ Optimal strong-stability-preserving time-stepping schemes with fast downwind spatial discretizations ⋮ On monotonicity and boundedness properties of linear multistep methods ⋮ Strong stability preserving hybrid methods ⋮ Computation of optimal linear strong stability preserving methods via adaptive spectral transformations of Poisson-Charlier measures ⋮ Strong Stability Preserving Explicit Linear Multistep Methods with Variable Step Size ⋮ Strong Stability Preserving Time Discretizations: A Review ⋮ Stability and boundedness in the numerical solution of initial value problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear stability behaviour of linear multistep methods
• Circle contractive linear multistep methods
• Absolute monotonicity of rational functions occurring in the numerical solution of initial value problems
• Contractivity preserving explicit linear multistep methods
• Stability of explicit time discretizations for solving initial value problems
• Contractivity in the numerical solution of initial value problems
• Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
• Analysis of explicit difference methods for a diffusion‐convection equation
• Conservation de la positivité lors de la discrétisation des problèmes d'évolution paraboliques
• Contractive methods for stiff differential equations part I

This page was built for publication: Contractivity preserving explicit linear multistep methods