\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

Efficient time discretization for local discontinuous Galerkin methods

Abstract Related Papers Cited by
  • In this paper, we explore three efficient time discretization techniques for the local discontinuous Galerkin (LDG) methods to solve partial differential equations (PDEs) with higher order spatial derivatives. The main difficulty is the stiffness of the LDG spatial discretization operator, which would require a unreasonably small time step for an explicit local time stepping method. We focus our discussion on the semi-implicit spectral deferred correction (SDC) method, and study its stability and accuracy when coupled with the LDG spatial discretization. We also discuss two other time discretization techniques, namely the additive Runge-Kutta (ARK) method and the exponential time differencing (ETD) method, coupled with the LDG spatial discretization. A comparison is made among these three time discretization techniques, to conclude that all three methods are efficient when coupled with the LDG spatial discretization for solving PDEs containing higher order spatial derivatives. In particular, the SDC method has the advantage of easy implementation for arbitrary order of accuracy, and the ARK method has the smallest CPU cost in our implementation.
    Mathematics Subject Classification: Primary: 65L06, 65M60.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
SHARE

Article Metrics

HTML views() PDF downloads(288) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return