New third order low-storage SSP explicit Runge-Kutta methods
From MaRDI portal
Abstract: When a high dimension system of ordinary differential equations is solved numerically, the computer memory capacity may be compromised. Thus, for such systems, it is important to incorporate low memory usage to some other properties of the scheme. In the context of strong stability preserving (SSP) schemes, some low-storage methods have been considered in the literature. In this paper we study 5-stage third order 2N* low-storage SSP explicit Runge-Kutta schemes. These are SSP schemes that can be implemented with 2N memory registers, where N is the dimension of the problem, and retain the previous time step approximation. This last property is crucial for a variable step size implementation of the scheme. In this paper, first we show that the optimal SSP methods cannot be implemented with 2N* memory registers. Next, two non-optimal SSP 2N* low-storage methods are constructed; although their SSP coefficients are not optimal, they achieve some other interesting properties. Finally, we show some numerical experiments.
Recommendations
- Efficient SSP low-storage Runge-Kutta methods
- Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
- On some new low storage implementations of time advancing Runge-Kutta methods
- Strong stability preserving explicit Runge-Kutta methods of maximal effective order
- On the performance of low storage additive Runge-Kutta methods
Cites work
- scientific article; zbMATH DE number 5820030 (Why is no real title available?)
- scientific article; zbMATH DE number 3560637 (Why is no real title available?)
- A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization Methods
- Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
- Contractivity in the numerical solution of initial value problems
- Contractivity of Runge-Kutta methods
- Efficient implementation of essentially nonoscillatory shock-capturing schemes
- Finite Volume Methods for Hyperbolic Problems
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- High order strong stability preserving time discretizations
- Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
- Low-storage Runge-Kutta schemes
- Low-storage implicit/explicit Runge-Kutta schemes for the simulation of stiff high-dimensional ODE systems
- Low-storage, explicit Runge-Kutta schemes for the compressible Navier-Stokes equations
- Minimum storage Runge-Kutta schemes for computational acoustics.
- Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods
- On some new low storage implementations of time advancing Runge-Kutta methods
- Optimal implicit strong stability preserving Runge-Kutta methods
- Representations of Runge--Kutta Methods and Strong Stability Preserving Methods
- Runge-Kutta methods with minimum storage implementations
- Solving Ordinary Differential Equations I
- Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
- Stepsize Restrictions for Stability of One-Step Methods in the Numerical Solution of Initial Value Problems
- Stepsize Restrictions for the Total-Variation-Diminishing Property in General Runge--Kutta Methods
- Strong Stability for Additive Runge–Kutta Methods
- Strong stability of singly-diagonally-implicit Runge-Kutta methods
- Strong stability-preserving high-order time discretization methods
- Total variation diminishing Runge-Kutta schemes
- Total-Variation-Diminishing Time Discretizations
Cited in
(3)
This page was built for publication: New third order low-storage SSP explicit Runge-Kutta methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316203)
