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.

 

Supercloseness of the local discontinuous Galerkin method for a singularly perturbed convection-diffusion problem
HTML articles powered by AMS MathViewer

by Yao Cheng, Shan Jiang and Martin Stynes HTML | PDF
Math. Comp. 92 (2023), 2065-2095 Request permission

Abstract:

A singularly perturbed convection-diffusion problem posed on the unit square in $\mathbb {R}^2$, whose solution has exponential boundary layers, is solved numerically using the local discontinuous Galerkin (LDG) method with tensor-product piecewise polynomials of degree at most $k>0$ on three families of layer-adapted meshes: Shishkin-type, Bakhvalov-Shishkin-type and Bakhvalov-type. On Shishkin-type meshes this method is known to be no greater than $O(N^{-(k+1/2)})$ accurate in the energy norm induced by the bilinear form of the weak formulation, where $N$ mesh intervals are used in each coordinate direction. (Note: all bounds in this abstract are uniform in the singular perturbation parameter and neglect logarithmic factors that will appear in our detailed analysis.) A delicate argument is used in this paper to establish $O(N^{-(k+1)})$ energy-norm superconvergence on all three types of mesh for the difference between the LDG solution and a local Gauss-Radau projection of the true solution into the finite element space. This supercloseness property implies a new $N^{-(k+1)}$ bound for the $L^2$ error between the LDG solution on each type of mesh and the true solution of the problem; this bound is optimal (up to logarithmic factors). Numerical experiments confirm our theoretical results.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 65N15, 65N30
  • Retrieve articles in all journals with MSC (2020): 65N15, 65N30
Additional Information
  • Yao Cheng
  • Affiliation: School of Mathematical Sciences, Suzhou University of Science and Technology, Suzhou 215009, Jiangsu Province, People’s Republic of China
  • ORCID: 0000-0001-9500-9398
  • Email: ycheng@usts.edu.cn
  • Shan Jiang
  • Affiliation: School of Science, Nantong University, Nantong 226019, Jiangsu Province, People’s Republic of China
  • ORCID: 0000-0001-7983-0012
  • Email: jiangshan@ntu.edu.cn
  • Martin Stynes
  • Affiliation: Applied and Computational Mathematics Division, Beijing Computational Science Research Center, Beijing 100193, People’s Republic of China
  • MR Author ID: 195989
  • ORCID: 0000-0003-2085-7354
  • Email: m.stynes@csrc.ac.cn
  • Received by editor(s): June 16, 2022
  • Received by editor(s) in revised form: December 12, 2022
  • Published electronically: May 4, 2023
  • Additional Notes: The research of the first author was supported by NSFC grant 11801396, Natural Science Foundation of Jiangsu Province grant BK20170374, Natural Science Foundation of the Jiangsu Higher Education Institutions of China grant 17KJB110016. The research of the second author was supported by NSFC grant 11771224. The research of the third author was supported by NSFC grants 12171025 and NSAF-U2230402.
  • © Copyright 2023 American Mathematical Society
  • Journal: Math. Comp. 92 (2023), 2065-2095
  • MSC (2020): Primary 65N15, 65N30
  • DOI: https://doi.org/10.1090/mcom/3844