A Polynomial Formulation of Adaptive Strong Stability Preserving Multistep Methods

DOI10.1137/17M1158811zbMath1432.65135OpenAlexW2907979805MaRDI QIDQ4646438

Carmen Arévalo, Fatemeh Mohammadi, Claus Fuehrer

Publication date: 14 January 2019

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1158811

zbMATH Keywords

strong stability preservingvariable step-sizesadaptive multistep methods

Mathematics Subject Classification ID

Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Numerical solution of discretized equations for initial value and initial-boundary value problems involving PDEs (65M22)

Related Items (1)

General relaxation methods for initial-value problems with application to multistep schemes

Uses Software

• Matlab
• MODES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractivity preserving explicit linear multistep methods
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• Weighted essentially non-oscillatory schemes
• On strong stability preserving time discretization methods
• Efficient implementation of weighted ENO schemes
• The logarithmic norm. History and modern theory
• High-order linear multistep methods with general monotonicity and boundedness properties
• Strong Stability-Preserving High-Order Time Discretization Methods
• Strong Stability Preserving Explicit Linear Multistep Methods with Variable Step Size
• Computation of optimal monotonicity preserving general linear methods
• Grid-Independent Construction of Multistep Methods
• A Software Platform for Adaptive High Order Multistep Methods

This page was built for publication: A Polynomial Formulation of Adaptive Strong Stability Preserving Multistep Methods