Sponsor
Partially supported by the National Science Foundation (Grant DMS-0712955) and by the Minnesota Supercomputing Institute
Published In
IMA Journal of Numerical Analysis
Document Type
Post-Print
Publication Date
10-2013
Subjects
Multigrid methods (Numerical analysis), Galerkin methods, Discontinuous functions
Abstract
We analyze the convergence of a multigrid algorithm for the Hybridizable Discontinuous Galerkin (HDG) method for diffusion problems. We prove that a non-nested multigrid V-cycle, with a single smoothing step per level, converges at a mesh independent rate. Along the way, we study conditioning of the HDG method, prove new error estimates for it, and identify an abstract class of problems for which a nonnested two-level multigrid cycle with one smoothing step converges even when the prolongation norm is greater than one. Numerical experiments verifying our theoretical results are presented.
DOI
10.1093/imanum/drt024
Persistent Identifier
http://archives.pdx.edu/ds/psu/10594
Citation Details
Cockburn, Bernardo; Bubois, O.; and Gopalakrishnan, Jay, "Multigrid for an HDG Method" (2013). Mathematics and Statistics Faculty Publications and Presentations. 34.
https://pdxscholar.library.pdx.edu/mth_fac/34
Description
This is an Author's Accepted Manuscript of an article published in IMA Journal of Numerical Analysis (2013) doi: 10.1093/imanum/drt024. © 2013 by Cambridge University Press.
The original publication is available at http://journals.cambridge.org