Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear order

DOI10.1090/mcom/2966zbMath1321.65138arXiv1403.6519OpenAlexW2019673734MaRDI QIDQ5501144

Daniel Higgs, Sigal Gottlieb, Zachary J. Grant

Publication date: 13 August 2015

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

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

zbMATH Keywords

Runge-Kutta methodhyperbolic equationsstrong stability preservinghigh linear-order methodnonlinear order

Mathematics Subject Classification ID

Second-order nonlinear hyperbolic equations (35L70) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) 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 (6)

Embedded pairs for optimal explicit strong stability preserving Runge-Kutta methods ⋮ New multi-implicit space-time spectral element methods for advection-diffusion-reaction problems ⋮ Implicit and implicit-explicit strong stability preserving Runge-Kutta methods with high linear order ⋮ Effective high-order energy stable flux reconstruction methods for first-order hyperbolic linear and nonlinear systems ⋮ The flux reconstruction method with Lax-Wendroff type temporal discretization for hyperbolic conservation laws ⋮ Strong Stability Preserving Time Discretizations: A Review

Uses Software

• Rk-opt
• GitHub

Cites Work

• Unnamed Item
• Runge-Kutta methods with minimum storage implementations
• Optimal implicit strong stability preserving Runge-Kutta 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
• Absolute monotonicity of polynomials occuring in the numerical solution of initial value problems
• Computation of optimal monotonicity preserving general linear methods
• Strong Stability Preserving Two-step Runge–Kutta Methods
• Spectral Methods for Time-Dependent Problems
• Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
• Total-Variation-Diminishing Time Discretizations
• Total variation diminishing Runge-Kutta schemes
• 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

This page was built for publication: Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear order