Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.98.

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.

 

Optimal convergence and superconvergence of semi-Lagrangian discontinuous Galerkin methods for linear convection equations in one space dimension
HTML articles powered by AMS MathViewer

by Yang Yang, Xiaofeng Cai and Jing-Mei Qiu HTML | PDF
Math. Comp. 89 (2020), 2113-2139 Request permission

Abstract:

In this paper, we apply semi-Lagrangian discontinuous Galerkin (SLDG) methods for linear hyperbolic equations in one space dimension and analyze the error between the numerical and exact solutions under the $L^2$-norm. In all the previous works, the theoretical analysis of the SLDG method would suggest a suboptimal convergence rate due to the error accumulation over time steps. However, numerical experiments demonstrate an optimal convergence rate and, if the terminal time is large, a superconvergence rate. In this paper, we will prove optimal convergence and optimal superconvergence rates. There are three main difficulties: 1. The error analysis on overlapping meshes. Due to the nature of the semi-Lagrangian time discretization, we need to introduce the background Eulerian mesh and the shifted mesh. The two meshes are staggered, and it is not easy to construct local projections and to handle the error accumulation during time evolution. 2. The superconvergence of time-dependent terms under the $L^2$-norm. The error of the numerical and exact solutions can be divided into two parts, the projection error and the time-dependent superconvergence term. The projection strongly depends on the superconvergence rates. Therefore, we need to construct a sequence of projections and gradually improve the superconvergence rates. 3. The stopping criterion of the sequence of projections. The sequence of projections are basically of the same form. We need to show that the projections exist up to some certain order since the superconvergence rate cannot be infinity. Hence, we will seek some β€œhidden” condition for the existence of the projections. In this paper, we will solve all the three difficulties and construct several local projections to prove the optimal convergence and superconvergence rates. Numerical experiments verify the theoretical findings.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65M15, 65M60, 65M20
  • Retrieve articles in all journals with MSC (2010): 65M15, 65M60, 65M20
Additional Information
  • Yang Yang
  • Affiliation: Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931
  • MR Author ID: 1008921
  • Email: yyang7@mtu.edu
  • Xiaofeng Cai
  • Affiliation: Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716
  • MR Author ID: 1167587
  • Email: xfcai@udel.edu
  • Jing-Mei Qiu
  • Affiliation: Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716
  • MR Author ID: 843920
  • Email: jingqiu@udel.edu
  • Received by editor(s): August 21, 2019
  • Received by editor(s) in revised form: January 10, 2020
  • Published electronically: March 10, 2020
  • Additional Notes: The first author was supported by NSF grant DMS-1818467.
    The second and third authors were supported by NSF grant NSF-DMS-1818924, Air Force Office of Scientific Computing FA9550-18-1-0257.
  • © Copyright 2020 American Mathematical Society
  • Journal: Math. Comp. 89 (2020), 2113-2139
  • MSC (2010): Primary 65M15, 65M60; Secondary 65M20
  • DOI: https://doi.org/10.1090/mcom/3527
  • MathSciNet review: 4109562