Strong-stability-preserving additive linear multistep methods

DOI10.1090/MCOM/3296MaRDI QIDQ4640323zbMATH OpenOpenAlexFDO

Authors Yiannis Hadjimichael, David I. Ketcheson

Publication date 17 May 2018

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.03637

zbMATH Keywords

ordinary differential equationsmultistep methodsstrong-stability-preserving scheme

Mathematics Subject Classification ID

Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Abstract: The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal additive and perturbed monotonicity-preserving linear multistep methods are studied in the context of such problems. Optimal perturbed methods attain larger monotonicity-preserving step sizes when the different forward Euler conditions are taken into account. On the other hand, we show that optimal SSP additive methods achieve a monotonicity-preserving step-size restriction no better than that of the corresponding non-additive SSP linear multistep methods.

Recommendations

• On high order strong stability preserving Runge-Kutta and multi step time discretizations
• On strong stability preserving time discretization methods
• Characterizing strong stability preserving additive Runge-Kutta methods
• Strong stability preserving Runge-Kutta and linear multistep methods
• STRONG STABILITY PRESERVING MULTISTAGE INTEGRATION METHODS

Cites work

• scientific article; zbMATH DE number 5820030 (Why is no real title available?)
• scientific article; zbMATH DE number 3521050 (Why is no real title available?)
• A study of numerical methods for hyperbolic conservation laws with stiff source terms
• Accuracy and Stability of Numerical Algorithms
• Circle contractive linear multistep methods
• Computation of optimal monotonicity preserving general linear methods
• Contractive methods for stiff differential equations part I
• Contractivity in the numerical solution of initial value problems
• Contractivity preserving explicit linear multistep methods
• Contractivity-Preserving Implicit Linear Multistep Methods
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• High-order linear multistep methods with general monotonicity and boundedness properties
• IMEX extensions of linear multistep methods with general monotonicity and boundedness properties
• Implicit-explicit methods based on strong stability preserving multistep time discretizations
• Monotonicity-Preserving Linear Multistep Methods
• On stability issues for IMEX schemes applied to 1D scalar hyperbolic equations with stiff reaction terms
• Optimal strong-stability-preserving time-stepping schemes with fast downwind spatial discretizations
• Step sizes for strong stability preservation with downwind-biased operators
• Strong Stability for Additive Runge–Kutta Methods
• Total-Variation-Diminishing Time Discretizations

Cited in

(6)

• A polynomial formulation of adaptive strong stability preserving multistep methods
• Step sizes for strong stability preservation with downwind-biased operators
• A new class of strong stability preserving general linear methods
• STRONG STABILITY PRESERVING MULTISTAGE INTEGRATION METHODS
• Computation of optimal monotonicity preserving general linear methods
• Characterizing strong stability preserving additive Runge-Kutta methods

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: Strong-stability-preserving additive linear multistep methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640323)