Efficient SSP low-storage Runge-Kutta methods

DOI10.1016/j.cam.2019.112500zbMath1458.65085OpenAlexW2977071030MaRDI QIDQ2223817

Teo Roldán, Inmaculada Higueras

Publication date: 3 February 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2019.112500

zbMATH Keywords

initial value problemRunge-Kutta methodtotal variation diminishingstrong stability preservinglocal error termlow-storage method

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for stiff equations (65L04)

Uses Software

• Rk-opt

Cites Work

• Unnamed Item
• Unnamed Item
• On some new low storage implementations of time advancing Runge-Kutta methods
• High order strong stability preserving time discretizations
• Low-storage implicit/explicit Runge-Kutta schemes for the simulation of stiff high-dimensional ODE systems
• Runge-Kutta methods with minimum storage implementations
• Strong stability preserving explicit peer methods
• Strong stability of singly-diagonally-implicit Runge-Kutta methods
• Optimal implicit strong stability preserving Runge-Kutta methods
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• Low-storage Runge-Kutta schemes
• Contractivity of Runge-Kutta methods
• Minimum storage Runge-Kutta schemes for computational acoustics.
• Low-storage, explicit Runge-Kutta schemes for the compressible Navier-Stokes equations
• Contractivity in the numerical solution of initial value problems
• Non-linear evolution using optimal fourth-order strong-stability-preserving Runge-Kutta methods
• Optimized strong stability preserving IMEX Runge-Kutta methods
• Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
• Strong stability preserving integrating factor two-step Runge-Kutta methods
• New third order low-storage SSP explicit Runge-Kutta methods
• Strong Stability-Preserving High-Order Time Discretization Methods
• Explicit strong stability preserving multistep Runge–Kutta methods
• Strong Stability Preserving Two-step Runge–Kutta Methods
• 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
• Total-Variation-Diminishing Time Discretizations
• Total variation diminishing Runge-Kutta schemes
• Finite Volume Methods for Hyperbolic Problems
• 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
• Highly Efficient Strong Stability-Preserving Runge–Kutta Methods with Low-Storage Implementations
• Representations of Runge--Kutta Methods and Strong Stability Preserving Methods
• Global optimization of explicit strong-stability-preserving Runge-Kutta methods
• Strong Stability for Additive Runge–Kutta Methods

This page was built for publication: Efficient SSP low-storage Runge-Kutta methods