@Article{JCM-27-5,
author = {},
title = {Local Multigrid in H(Curl)},
journal = {Journal of Computational Mathematics},
year = {2009},
volume = {27},
number = {5},
pages = {573--603},
abstract = {<p style="text-align: justify;">We consider $\boldsymbol{H}$(<strong>curl</strong>, $Ω$)-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence theory for the the so-called local multigrid correction scheme with hybrid smoothing. We establish that its convergence rate is uniform with respect to the number of refinement steps. The proof relies on corresponding results for local multigrid in a $H^1(Ω)$-context along with local discrete Helmholtz-type decompositions of the edge element space.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2009.27.5.012},
url = {https://global-sci.com/article/84887/local-multigrid-in-hcurl}
}