Uniform convergence of adaptive multigrid methods for elliptic problems and Maxwell's equations

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We consider the convergence theory of adaptive multigrid methods for secondorder 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. © 2012 Global-Science Press.

Cite

CITATION STYLE

APA

Hiptmair, R., Wu, H., & Zheng, W. (2012). Uniform convergence of adaptive multigrid methods for elliptic problems and Maxwell’s equations. Numerical Mathematics, 5(3), 297–332. https://doi.org/10.4208/nmtma.2012.m1128

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free