Strong Stability Preserving Time Discretizations: A Review
DOI10.1007/978-3-319-19800-2_2zbMath1352.65291OpenAlexW2341271813MaRDI QIDQ2831180
Publication date: 2 November 2016
Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19800-2_2
semidiscretizationRunge-Kutta methodshyperbolic conservation lawstrong stability preservingreview articleEuler time stepping
Hyperbolic conservation laws (35L65) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) 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)
Related Items (3)
Cites Work
- Unnamed Item
- Optimal implicit strong stability preserving Runge-Kutta methods
- Strong stability preserving hybrid methods
- Contractivity preserving explicit linear multistep methods
- Efficient implementation of essentially nonoscillatory shock-capturing schemes
- Contractivity of Runge-Kutta methods
- Strong stability preserving properties of Runge--Kutta time discretization methods for linear constant coefficient operators
- Two barriers on strong-stability-preserving time discretization methods
- On strong stability preserving time discretization methods
- Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
- High-order linear multistep methods with general monotonicity and boundedness properties
- Strong Stability-Preserving High-Order Time Discretization Methods
- Explicit strong stability preserving multistep Runge–Kutta methods
- Optimal Explicit Strong-Stability-Preserving General Linear Methods
- Computation of optimal monotonicity preserving general linear methods
- Step Sizes for Strong Stability Preservation with Downwind-Biased Operators
- Strong Stability Preserving Two-step Runge–Kutta Methods
- 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
- Total variation diminishing Runge-Kutta schemes
- Monotonicity-Preserving Linear Multistep Methods
- Stepsize Restrictions for the Total-Variation-Diminishing Property in General Runge--Kutta Methods
- A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization Methods
- An extension and analysis of the Shu-Osher representation of Runge-Kutta methods
- Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
- Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear order
- Representations of Runge--Kutta Methods and Strong Stability Preserving Methods
This page was built for publication: Strong Stability Preserving Time Discretizations: A Review