Time Step Restrictions for Strong-Stability-Preserving Multistep Runge–Kutta Discontinuous Galerkin Methods

被引:0
|
作者
Benjamin Yeager
Ethan Kubatko
Dylan Wood
机构
[1] New York University,
[2] The Ohio State University,undefined
[3] Notre Dame University,undefined
来源
关键词
Discontinuous Galerkin; Strong-stability-preserving; Multistep Runge–Kutta; Linear stability; Time stepping; 65M12; 65M60;
D O I
暂无
中图分类号
学科分类号
摘要
Discontinuous Galerkin finite element spatial discretizations are often used in a method-of-lines approach with an ordinary differential equation solver to step the solution forward in time. Explicit strong-stability-preserving time steppers are a popular choice because they provably preserve the nonlinear stability properties of the forward Euler method applied to discontinuous Galerkin semi-discretized equations, subject to a time step constraint. While nonlinear stability is guaranteed by strong-stability-preservation, a separate condition for linear stability of the combined scheme must also be satisfied. In this work, we assess the linear stability properties of discontinuous Galerkin spatial discretizations with a set of strong-stability-preserving multistep Runge–Kutta methods. We find that, in all cases, the constraint for linear stability is more strict than that for strong-stability-preservation. For each order, from the set of multistep Runge–Kutta methods, we select an optimal time stepper that requires the fewest evaluations of the discontinuous Galerkin operator. All methods are tested for convergence in application to both a linear and a nonlinear partial differential equation, and all methods are found to converge in both cases using the maximum stable time step as determined by the stability constraints found in this paper.
引用
收藏
相关论文
共 50 条
  • [1] Time Step Restrictions for Strong-Stability-Preserving Multistep Runge-Kutta Discontinuous Galerkin Methods
    Yeager, Benjamin
    Kubatko, Ethan
    Wood, Dylan
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2021, 89 (02)
  • [2] Optimal Strong-Stability-Preserving Runge–Kutta Time Discretizations for Discontinuous Galerkin Methods
    Ethan J. Kubatko
    Benjamin A. Yeager
    David I. Ketcheson
    [J]. Journal of Scientific Computing, 2014, 60 : 313 - 344
  • [3] Optimal Strong-Stability-Preserving Runge-Kutta Time Discretizations for Discontinuous Galerkin Methods
    Kubatko, Ethan J.
    Yeager, Benjamin A.
    Ketcheson, David I.
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2014, 60 (02) : 313 - 344
  • [4] Semi discrete discontinuous Galerkin methods and stage-exceeding-order, strong-stability-preserving Runge-Kutta time discretizations
    Kubatko, Ethan J.
    Westerink, Joannes J.
    Dawson, Clint
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2007, 222 (02) : 832 - 848
  • [5] Time step restrictions for Runge-Kutta discontinuous Galerkin methods on triangular grids
    Kubatko, Ethan J.
    Dawson, Clint
    Westerink, Joannes J.
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2008, 227 (23) : 9697 - 9710
  • [6] Strong Stability Preserving Runge–Kutta and Linear Multistep Methods
    Giuseppe Izzo
    Zdzislaw Jackiewicz
    [J]. Bulletin of the Iranian Mathematical Society, 2022, 48 (6) : 4029 - 4062
  • [7] Strong Stability Preserving Runge-Kutta and Linear Multistep Methods
    Izzo, Giuseppe
    Jackiewicz, Zdzislaw
    [J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2022, 48 (06) : 4029 - 4062
  • [8] Global optimization of explicit strong-stability-preserving Runge-Kutta methods
    Ruuth, SJ
    [J]. MATHEMATICS OF COMPUTATION, 2006, 75 (253) : 183 - 207
  • [9] EXPLICIT STRONG STABILITY PRESERVING MULTISTEP RUNGE-KUTTA METHODS
    Bresten, Christopher
    Gottlieb, Sigal
    Grant, Zachary
    Higgs, Daniel
    Ketcheson, David I.
    Nemeth, Adrian
    [J]. MATHEMATICS OF COMPUTATION, 2017, 86 (304) : 747 - 769
  • [10] On the stability of strong-stability-preserving modified Patankar-Runge-Kutta schemes
    Huang, Juntao
    Izgin, Thomas
    Kopecz, Stefan
    Meister, Andreas
    Shu, Chi-Wang
    [J]. ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS, 2023, 57 (02) : 1063 - 1086