TY - JOUR
T1 - Optimal Strong-Stability-Preserving Runge–Kutta Time Discretizations for Discontinuous Galerkin Methods
AU - Kubatko, Ethan J.
AU - Yeager, Benjamin A.
AU - Ketcheson, David I.
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The first and second author acknowledge support by National Science Foundation grants DMS-0915118 and DMS-1217218.
PY - 2013/10/29
Y1 - 2013/10/29
N2 - Discontinuous Galerkin (DG) spatial discretizations are often used in a method-of-lines approach with explicit strong-stability-preserving (SSP) Runge–Kutta (RK) time steppers for the numerical solution of hyperbolic conservation laws. The time steps that are employed in this type of approach must satisfy Courant–Friedrichs–Lewy stability constraints that are dependent on both the region of absolute stability and the SSP coefficient of the RK method. While existing SSPRK methods have been optimized with respect to the latter, it is in fact the former that gives rise to stricter constraints on the time step in the case of RKDG stability. Therefore, in this work, we present the development of new “DG-optimized” SSPRK methods with stability regions that have been specifically designed to maximize the stable time step size for RKDG methods of a given order in one space dimension. These new methods represent the best available RKDG methods in terms of computational efficiency, with significant improvements over methods using existing SSPRK time steppers that have been optimized with respect to SSP coefficients. Second-, third-, and fourth-order methods with up to eight stages are presented, and their stability properties are verified through application to numerical test cases.
AB - Discontinuous Galerkin (DG) spatial discretizations are often used in a method-of-lines approach with explicit strong-stability-preserving (SSP) Runge–Kutta (RK) time steppers for the numerical solution of hyperbolic conservation laws. The time steps that are employed in this type of approach must satisfy Courant–Friedrichs–Lewy stability constraints that are dependent on both the region of absolute stability and the SSP coefficient of the RK method. While existing SSPRK methods have been optimized with respect to the latter, it is in fact the former that gives rise to stricter constraints on the time step in the case of RKDG stability. Therefore, in this work, we present the development of new “DG-optimized” SSPRK methods with stability regions that have been specifically designed to maximize the stable time step size for RKDG methods of a given order in one space dimension. These new methods represent the best available RKDG methods in terms of computational efficiency, with significant improvements over methods using existing SSPRK time steppers that have been optimized with respect to SSP coefficients. Second-, third-, and fourth-order methods with up to eight stages are presented, and their stability properties are verified through application to numerical test cases.
UR - http://hdl.handle.net/10754/333639
UR - http://link.springer.com/10.1007/s10915-013-9796-7
UR - http://www.scopus.com/inward/record.url?scp=84904255227&partnerID=8YFLogxK
U2 - 10.1007/s10915-013-9796-7
DO - 10.1007/s10915-013-9796-7
M3 - Article
SN - 0885-7474
VL - 60
SP - 313
EP - 344
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 2
ER -