Abstract
A multilevel method on adaptive meshes with hanging nodes is presented, and the additional matrices appearing in the implementation are derived. Smoothers of overlapping Schwarz type are discussed; smoothing is restricted to the interior of the subdomains refined to the current level; thus it has optimal computational complexity. When applied to conforming finite element discretizations of elliptic problems and Maxwell equations, the method's convergence rates are very close to those for the nonadaptive version. Furthermore, the smoothers remain efficient for high order finite elements. We discuss the implementation in a general finite element code using the example of the deal.II library. © 2011 Societ y for Industrial and Applied Mathematics.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2095-2114 |
| Number of pages | 20 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 33 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jan 2011 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: This author's work was supported by the German Research Association (DFG) and the International Graduate College IGK 710.This author's work was supported by the National Science Foundation under grants DMS-0713829 and DMS-0810387 and by the King Abdullah University of Science and Technology (KAUST) through award KUS-C1-016-04. Some of the experiments were performed during a visit to the Institute of Mathematics and its Applications in Minneapolis.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.