Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 3D
Abstract
Overlapping Schwarz methods are among the most successful domain decomposition preconditioners for large-scale finite element simulations. In this work, the Generalized Dryja-Smith-Widlund (GDSW), GDSW*, and Reduced GDSW (RGDSW) coarse spaces are studied for three-dimensional high-order finite element method (FEM) and virtual element method (VEM) for the Poisson equation and the equations of linear elasticity. To the best of our knowledge, this is the first study of GDSW-type coarse spaces for polynomial degrees k≥ 3 in three dimensions, for either discretization. In 3D VEM, the face degrees of freedom (DOFs) are moments instead of point values. The kernel of the differential operator, which defines the interface values of the GDSW coarse basis functions, must be represented through these moments. The construction is therefore no longer purely algebraic and, without this correction, the coarse level loses its effect for k≥ 3. FEM and VEM are tested on hexahedral meshes, and VEM is additionally tested on polyhedral ones. Polynomial degrees up to k=5 and runs on up to 4 096 subdomains and parallel cores are included in the numerical study. Numerical experiments show scalable iteration counts for all coarse space variants for the Poisson problem, illustrating the expected trade-off between the coarse space size and robustness. Further experiments for linear elasticity confirms that the moment-based construction extends naturally from the scalar to the vector-valued problem.
Related
- Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 2D
- Two-level hybrid Schwarz preconditioners with preasymptotic piecewise-polynomial coarse spaces for the high-frequency Helmholtz equation
- A nonoverlapping spectral additive Schwarz method for interior penalty discontinuous Galerkin discretizations of Anisotropic Elliptic Problems
- A structure-aware construction of quantum BPX preconditioners for Q1 finite element discretizations of reaction-diffusion problems
- An algebraic multiscale framework for two-level overlapping Schwarz preconditioners
BibTeX
@misc{bevilacqua2026twolevel,
title = {{Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 3D}},
author = {Tommaso Bevilacqua and Axel Klawonn and Martin Lanser and Adam Wasiak},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03447},
eprint = {2611.03447},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03447},
}
RIS
TY - UNPB
TI - Two-level additive Schwarz preconditioners with GDSW coarse spaces for high-order discretizations in 3D
AU - Tommaso Bevilacqua
AU - Axel Klawonn
AU - Martin Lanser
AU - Adam Wasiak
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.03447
UR - https://arxiv.org/abs/2611.03447
AB - Overlapping Schwarz methods are among the most successful domain decomposition preconditioners for large-scale finite element simulations. In this work, the Generalized Dryja-Smith-Widlund (GDSW), GDSW^*, and Reduced GDSW (RGDSW) coarse spaces are studied for three-dimensional high-order finite element method (FEM) and virtual element method (VEM) for the Poisson equation and the equations of linear elasticity. To the best of our knowledge, this is the first study of GDSW-type coarse spaces for polynomial degrees k≥ 3 in three dimensions, for either discretization. In 3D VEM, the face degrees of freedom (DOFs) are moments instead of point values. The kernel of the differential operator, which defines the interface values of the GDSW coarse basis functions, must be represented through these moments. The construction is therefore no longer purely algebraic and, without this correction, the coarse level loses its effect for k≥ 3. FEM and VEM are tested on hexahedral meshes, and VEM is additionally tested on polyhedral ones. Polynomial degrees up to k=5 and runs on up to 4 096 subdomains and parallel cores are included in the numerical study. Numerical experiments show scalable iteration counts for all coarse space variants for the Poisson problem, illustrating the expected trade-off between the coarse space size and robustness. Further experiments for linear elasticity confirms that the moment-based construction extends naturally from the scalar to the vector-valued problem.
ER -