Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in <i>H</i>(div)

In this paper, we construct and analyze preconditioners for the interior penalty discontinuous Galerkin discretization posed in the space H (div). These discretizations are used as one component in exactly divergence-free pressure-robust discretizations for the Stokes problem. Three preconditioners are presently considered: a subspace correction preconditioner using vertex patches and the lowest-order H 1 -conforming space as a coarse space, a fictitious space preconditioner using the degree- p discontinuous Galerkin space, and an auxiliary space preconditioner using the degree-( p − 1) discontinuous Galerkin space and a block Jacobi smoother. On certain classes of meshes, the subspace and fictitious space preconditioners result in provably well-conditioned systems, independent of the mesh size h , polynomial degree p , and penalty parameter η . All three preconditioners are shown to be robust with respect to h on general meshes, and numerical results indicate that the iteration counts grow only mildly with respect to p in the general case. Numerical examples illustrate the convergence properties of the preconditioners applied to structured and unstructured meshes. These solvers are used to construct block-diagonal preconditioners for the Stokes problem, which result in uniform convergence when used with MINRES.

Authors

Institutions

Publication Details

Journal
ESAIM. Mathematical modelling and numerical analysis
Published
2025-06-06
DOI
https://doi.org/10.1051/m2an/2025045
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in H(div)

Will Pazner
ESAIM. Mathematical modelling and numerical analysis
Advanced Numerical Methods in Computational Mathematics
article

Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in H(div)

Will Pazner
article en

Abstract

In this paper, we construct and analyze preconditioners for the interior penalty discontinuous Galerkin discretization posed in the space H (div). These discretizations are used as one component in exactly divergence-free pressure-robust discretizations for the Stokes problem. Three preconditioners are presently considered: a subspace correction preconditioner using vertex patches and the lowest-order H 1 -conforming space as a coarse space, a fictitious space preconditioner using the degree- p discontinuous Galerkin space, and an auxiliary space preconditioner using the degree-( p − 1) discontinuous Galerkin space and a block Jacobi smoother. On certain classes of meshes, the subspace and fictitious space preconditioners result in provably well-conditioned systems, independent of the mesh size h , polynomial degree p , and penalty parameter η . All three preconditioners are shown to be robust with respect to h on general meshes, and numerical results indicate that the iteration counts grow only mildly with respect to p in the general case. Numerical examples illustrate the convergence properties of the preconditioners applied to structured and unstructured meshes. These solvers are used to construct block-diagonal preconditioners for the Stokes problem, which result in uniform convergence when used with MINRES.

ESAIM. Mathematical modelling and numerical analysisVol. 59(4)
Portland State University (US)
Oak Ridge Associated Universities
Openalex Percentile: Top 86%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.