Metraipolis › archive › dc_fec9b7ad52ba

A Multigrid Method for CutFEM and its Convergence — arXiv:2609.04067

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04067
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:11.684Z
SHA-256 of the archived text
a7fb4bca1591a3c59452914809355423a308257522066cd2a4e33e8468b1ca07
Stable URL of this page
https://metraipolis.com/documento/dc_fec9b7ad52ba

How to cite

A Multigrid Method for CutFEM and its Convergence — arXiv:2609.04067 — arXiv (en), https://arxiv.org/abs/2609.04067 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fec9b7ad52ba (Metraipolis archive dc_fec9b7ad52ba, sha256 a7fb4bca1591a3c59452914809355423a308257522066cd2a4e33e8468b1ca07)
BibTeX
@misc{dcfec9b7ad52ba,
  title = {A Multigrid Method for CutFEM and its Convergence — arXiv:2609.04067},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04067},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fec9b7ad52ba; sha256 a7fb4bca1591a3c59452914809355423a308257522066cd2a4e33e8468b1ca07},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04067. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a convergence theory for geometric multigrid with vertex-patch smoothers applied to cut finite element discretizations of the Poisson problem. The framework addresses non-inherited level forms and the mismatch between the physical and active domains. Using the discrete extension property, we prove two-level convergence bounds uniform in the mesh size and the cut geometry, and W-cycle bounds under an additional smallness assumption on the two-level rate. The numerical experiments intentionally use the stronger V-cycle, for which no convergence bound is claimed here. The convergence constants degrade with the degree $p$. Lowering the ghost penalty improves iteration counts. An aligned two-cell model exhibits a semidefiniteness threshold of order $p^{-2}$, whereas the visibility scale of a degree-$p$ cut mode decreases exponentially. Experiments at the model threshold reduce the iteration counts, but do not establish an assembled-operator threshold.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.04067 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:09:02.075Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).