Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 38 min ago
PreprintCC BY 4.0arXiv

Geometric multigrid preconditioners for unfitted discretisations of the de Rham complex

Abstract

We propose two families of multigrid preconditioners for unfitted finite element discretisations of the Riesz maps of the de Rham complex, in H(grad), H(curl) and H(div), stabilised by cell aggregation. The first is a geometric multigrid method applied directly to the unfitted operators, on a hierarchy of background meshes that share the same boundary representation. Its smoothers are star patches built on the aggregated mesh, so that each patch captures the kernel of the stabilisation. The second is a multilevel auxiliary-space preconditioner that combines a patch smoother localised around the cut cells with the body-fitted problem on the active mesh, which is in turn solved by a non-nested geometric multigrid method. Both are used as building blocks of block-diagonal preconditioners for the mixed Hodge Laplacians. Numerical experiments in two and three dimensions, on geometries with a controlled cut fraction and on general geometries, show iteration counts that are robust with respect to the cut configuration, the mesh size and the number of levels. We also report results for higher-order discretisations, weakly imposed Dirichlet boundary conditions and a face-based stabilisation.

Related

  1. Geometric Multigrid Preconditioners for conforming Finite Element Methods on Arbitrarily Agglomerated Meshes
    Santiago Badia, Jordi Manyer
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Semi-Algebraic Mode Analysis For Finite Element Discretisations Of The Heat Equation
    A. Mesforush, N. Habibi, F. Gasper +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. Space of Geometric Gibbs Measures: Uniqueness, Ergodicity, and Teichmüller Complex Manifold Structure
    Yunping Jiang
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsDynamical systemsarXiv
  4. The Orlik--Solomon algebra of a locally geometric poset and cohomology of complex abelian arrangements
    Christin Bibby, Peter Ramsey
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. Geometric Holder estimates for complex Monge-Ampere equations
    Bin Guo, Jian Song, Jacob Sturm
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
BibTeX
@misc{badia2026geometric,
  title = {{Geometric multigrid preconditioners for unfitted discretisations of the de Rham complex}},
  author = {Santiago Badia and Jordi Manyer},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.22865},
  eprint = {2610.22865},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.22865},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Geometric multigrid preconditioners for unfitted discretisations of the de Rham complex
AU  - Santiago Badia
AU  - Jordi Manyer
PY  - 2026
DA  - 2026/10/16
PB  - arXiv
DO  - 10.48550/arxiv.2610.22865
UR  - https://arxiv.org/abs/2610.22865
AB  - We propose two families of multigrid preconditioners for unfitted finite element discretisations of the Riesz maps of the de Rham complex, in H(grad), H(curl) and H(div), stabilised by cell aggregation. The first is a geometric multigrid method applied directly to the unfitted operators, on a hierarchy of background meshes that share the same boundary representation. Its smoothers are star patches built on the aggregated mesh, so that each patch captures the kernel of the stabilisation. The second is a multilevel auxiliary-space preconditioner that combines a patch smoother localised around the cut cells with the body-fitted problem on the active mesh, which is in turn solved by a non-nested geometric multigrid method. Both are used as building blocks of block-diagonal preconditioners for the mixed Hodge Laplacians. Numerical experiments in two and three dimensions, on geometries with a controlled cut fraction and on general geometries, show iteration counts that are robust with respect to the cut configuration, the mesh size and the number of levels. We also report results for higher-order discretisations, weakly imposed Dirichlet boundary conditions and a face-based stabilisation.
ER  -