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.

 

Error estimates for the AEDG method to one-dimensional linear convection-diffusion equations
HTML articles powered by AMS MathViewer

by Hailiang Liu and Hairui Wen PDF
Math. Comp. 87 (2018), 123-148 Request permission

Abstract:

We study the error estimates for the alternating evolution discontinuous Galerkin (AEDG) method to one-dimensional linear convection-diffusion equations. The AEDG method for general convection-diffusion equations was introduced by H. Liu and M. Pollack [J. Comp. Phys. 307 (2016), 574–592], where stability of the semi-discrete scheme was rigorously proved for linear problems under a CFL-like stability condition $\epsilon < Qh^2$. Here $\epsilon$ is the method parameter, and $h$ is the maximum spatial grid size. In this work, we establish optimal $L^2$ error estimates of order $O(h^{k+1})$ for $k$-th degree polynomials, under the same stability condition with $\epsilon \sim h^2$. For a fully discrete scheme with the forward Euler temporal discretization, we further obtain the $L^2$ error estimate of order $O(\tau +h^{k+1})$, under the stability condition $c_0\tau \le \epsilon < Qh^2$ for time step $\tau$; and an error of order $O(\tau ^2+h^{k+1})$ for the Crank-Nicolson time discretization with any time step $\tau$. Key tools include two approximation spaces to distinguish overlapping polynomials, two bi-linear operators, coupled global projections, and a duality argument adapted to the situation with overlapping polynomials.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65M15, 65M60, 35K20
  • Retrieve articles in all journals with MSC (2010): 65M15, 65M60, 35K20
Additional Information
  • Hailiang Liu
  • Affiliation: Department of Mathematics, Iowa State University, Ames, Iowa 50011
  • Email: hliu@iastate.edu
  • Hairui Wen
  • Affiliation: School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100080, People’s Republic of China
  • MR Author ID: 753749
  • Email: wenhr@bit.edu.cn
  • Received by editor(s): April 5, 2016
  • Received by editor(s) in revised form: August 30, 2016
  • Published electronically: May 1, 2017
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 123-148
  • MSC (2010): Primary 65M15, 65M60, 35K20
  • DOI: https://doi.org/10.1090/mcom/3226
  • MathSciNet review: 3716191