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 2020 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.

 

High order explicit local time stepping methods for hyperbolic conservation laws
HTML articles powered by AMS MathViewer

by Thi-Thao-Phuong Hoang, Lili Ju, Wei Leng and Zhu Wang HTML | PDF
Math. Comp. 89 (2020), 1807-1842 Request permission

Abstract:

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector-type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65M20, 65L06, 65M12
  • Retrieve articles in all journals with MSC (2010): 65M20, 65L06, 65M12
Additional Information
  • Thi-Thao-Phuong Hoang
  • Affiliation: Department of Mathematics and Statistics, Auburn University, Auburn, Alabama 36849
  • MR Author ID: 1047473
  • Email: tzh0059@auburn.edu
  • Lili Ju
  • Affiliation: Department of Mathematics, University of South Carolina, Columbia, South Carolina 29208
  • MR Author ID: 645968
  • Email: ju@math.sc.edu
  • Wei Leng
  • Affiliation: State Key Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences, Beijing 100190, People’s Republic of China
  • Email: wleng@lsec.cc.ac.cn
  • Zhu Wang
  • Affiliation: Department of Mathematics, University of South Carolina, Columbia, South Carolina 29208
  • MR Author ID: 762949
  • Email: wangzhu@math.sc.edu
  • Received by editor(s): May 22, 2019
  • Received by editor(s) in revised form: October 24, 2019
  • Published electronically: January 29, 2020
  • Additional Notes: This work was partially supported by the U.S. Department of Energy under grant numbers DE-SC0016540 and DE-SC0020270 and the U.S. National Science Foundation under grant numbers DMS-1818438 and DMS-1913073.
  • © Copyright 2020 American Mathematical Society
  • Journal: Math. Comp. 89 (2020), 1807-1842
  • MSC (2010): Primary 65M20, 65L06, 65M12
  • DOI: https://doi.org/10.1090/mcom/3507
  • MathSciNet review: 4081919