The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
An atlas of functions
Efficient implementation of essentially non-oscillatory shock-capturing schemes
Journal of Computational Physics
Total variation diminishing Runge-Kutta schemes
Mathematics of Computation
The Runge-Kutta discontinuous Galerkin method for conservation laws V multidimensional systems
Journal of Computational Physics
Runge–Kutta Discontinuous Galerkin Methods for Convection-Dominated Problems
Journal of Scientific Computing
High-order RKDG Methods for Computational Electromagnetics
Journal of Scientific Computing
Journal of Computational Physics
Journal of Scientific Computing
Scalability of an Unstructured Grid Continuous Galerkin Based Hurricane Storm Surge Model
Journal of Scientific Computing
CFL Conditions for Runge-Kutta discontinuous Galerkin methods on triangular grids
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational Physics
High-order solution-adaptive central essentially non-oscillatory (CENO) method for viscous flows
Journal of Computational Physics
Hi-index | 31.48 |
We derive CFL conditions for the linear stability of the so-called Runge-Kutta discontinuous Galerkin (RKDG) methods on triangular grids. Semidiscrete DG approximations using polynomials spaces of degree p=0,1,2, and 3 are considered and discretized in time using a number of different strong-stability-preserving (SSP) Runge-Kutta time discretization methods. Two structured triangular grid configurations are analyzed for wave propagation in different directions. Approximate relations between the two-dimensional CFL conditions derived here and previously established one-dimensional conditions can be observed after defining an appropriate triangular grid parameter h and a constant that is dependent on the polynomial degree p of the DG spatial approximation. Numerical results verify the CFL conditions that are obtained, and ''optimal'', in terms of computational efficiency, two-dimensional RKDG methods of a given order are identified.