Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

OEDG: Oscillation-eliminating discontinuous Galerkin method for hyperbolic conservation laws
HTML articles powered by AMS MathViewer

by Manting Peng, Zheng Sun and Kailiang Wu;
Math. Comp. 94 (2025), 1147-1198
DOI: https://doi.org/10.1090/mcom/3998
Published electronically: July 30, 2024

Abstract:

Suppressing spurious oscillations is crucial for designing reliable high-order numerical schemes for hyperbolic conservation laws, yet it has been a challenge actively investigated over the past several decades. This paper proposes a novel, robust, and efficient oscillation-eliminating discontinuous Galerkin (OEDG) method on general meshes, motivated by the damping technique (see J. Lu, Y. Liu, and C. W. Shu [SIAM J. Numer. Anal. 59 (2021), pp. 1299–1324]). The OEDG method incorporates an oscillation-eliminating (OE) procedure after each Runge–Kutta stage, and it is devised by alternately evolving the conventional semidiscrete discontinuous Galerkin (DG) scheme and a damping equation. A novel damping operator is carefully designed to possess both scale-invariant and evolution-invariant properties. We rigorously prove the optimal error estimates of the fully discrete OEDG method for smooth solutions of linear scalar conservation laws. This might be the first generic fully discrete error estimate for nonlinear DG schemes with an automatic oscillation control mechanism. The OEDG method exhibits many notable advantages. It effectively eliminates spurious oscillations for challenging problems spanning various scales and wave speeds, without necessitating problem-specific parameters for all the tested cases. It also obviates the need for characteristic decomposition in hyperbolic systems. Furthermore, it retains the key properties of the conventional DG method, such as local conservation, optimal convergence rates, and superconvergence. Moreover, the OEDG method maintains stability under the normal Courant–Friedrichs–Lewy (CFL) condition, even in the presence of strong shocks associated with highly stiff damping terms. The OE procedure is nonintrusive, facilitating seamless integration into existing DG codes as an independent module. Its implementation is straightforward and efficient, involving only simple multiplications of modal coefficients by scalars. The OEDG approach provides new insights into the damping mechanism for oscillation control. It reveals the role of the damping operator as a modal filter, establishing close relations between the damping technique and spectral viscosity techniques. Extensive numerical results validate the theoretical analysis and confirm the effectiveness and advantages of the OEDG method.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 65M60, 65M12, 35L65
  • Retrieve articles in all journals with MSC (2020): 65M60, 65M12, 35L65
Bibliographic Information
  • Manting Peng
  • Affiliation: Department of Mathematics, Southern University of Science and Technology, Shenzhen, Guangdong 518055, People’s Republic of China
  • Email: 12232855@mail.sustech.edu.cn
  • Zheng Sun
  • Affiliation: Department of Mathematics, The University of Alabama, Tuscaloosa, Alabama 35487
  • ORCID: 0000-0003-3763-3015
  • Email: zsun30@ua.edu
  • Kailiang Wu
  • Affiliation: Department of Mathematics, Southern University of Science and Technology, Shenzhen, Guangdong 518055, People’s Republic of China; and Shenzhen International Center for Mathematics, Southern University of Science and Technology, Shenzhen, Guangdong 518055, People’s Republic of China; and National Center for Applied Mathematics Shenzhen (NCAMS), Shenzhen, Guangdong 518055, People’s Republic of China
  • Email: wukl@sustech.edu.cn
  • Received by editor(s): October 26, 2023
  • Received by editor(s) in revised form: May 21, 2024
  • Published electronically: July 30, 2024
  • Additional Notes: The first and third authors were partially supported by Shenzhen Science and Technology Program (No. RCJC20221008092757098) and National Natural Science Foundation of China (No. 12171227). The second author was partially supported by NSF grant DMS-2208391.
    The third author is the corresponding author.
  • © Copyright 2024 American Mathematical Society
  • Journal: Math. Comp. 94 (2025), 1147-1198
  • MSC (2020): Primary 65M60, 65M12, 35L65
  • DOI: https://doi.org/10.1090/mcom/3998