Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T17:01:51.918Z Has data issue: false hasContentIssue false

Uniform Convergence of Adaptive Multigrid Methods for Elliptic Problems and Maxwell’s Equations

Published online by Cambridge University Press:  28 May 2015

Ralf Hiptmair*
Affiliation:
SAM, ETH Zürich, CH-8092 Zürich, Swizerland
Haijun Wu*
Affiliation:
Department of Mathematics, Nanjing University, Nanjing, Jiangsu, 210093, China
Weiying Zheng*
Affiliation:
LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China
*
Corresponding author.Email address:hiptmair@sam.math.ethz.ch
Corresponding author.Email address:hjw@nju.edu.cn
Corresponding author.Email address:zwy@lsec.cc.ac.en
Get access

Abstract

We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems and Maxwell’s equations. The multigrid algorithm only performs pointwise Gauss-Seidel relaxations on new degrees of freedom and their “immediate” neighbors. In the context of lowest order conforming finite element approximations, we present a unified proof for the convergence of adaptive multigrid V-cycle algorithms. The theory applies to any hierarchical tetrahedral meshes with uniformly bounded shape-regularity measures. The convergence rates for both problems are uniform with respect to the number of mesh levels and the number of degrees of freedom. We demonstrate our convergence theory by two numerical experiments.

Information

Type
Research Article
Copyright
Copyright © Global Science Press Limited 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable