Table of Contents
Fetching ...

Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in $H(\mathrm{div})$

Will Pazner

Abstract

In this paper, we construct and analyze preconditioners for the interior penalty discontinuous Galerkin discretization posed in the space $H(\mathrm{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.

Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in $H(\mathrm{div})$

Abstract

In this paper, we construct and analyze preconditioners for the interior penalty discontinuous Galerkin discretization posed in the space . 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 -conforming space as a coarse space, a fictitious space preconditioner using the degree- discontinuous Galerkin space, and an auxiliary space preconditioner using the degree- 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 , polynomial degree , and penalty parameter . All three preconditioners are shown to be robust with respect to on general meshes, and numerical results indicate that the iteration counts grow only mildly with respect to 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.

Paper Structure

This paper contains 18 sections, 22 theorems, 109 equations, 1 figure, 5 tables.

Key Result

Lemma 1

For all $\bm u_h, \bm v_h \in \bm{V}_h$, it holds that

Figures (1)

  • Figure 1: Panels (a) and (b): unstructured mesh of affine elements (parallelograms) and uniform refinement levels $\ell$ used for the test case in \ref{['sec:unstructured-affine']}. Panel (c): unstructured with with non-affine (skewed) elements used for the test case in \ref{['sec:unstructured-non-affine']}.

Theorems & Definitions (42)

  • Remark 1: Affine and non-affine elements
  • Remark 2: Notation
  • Lemma 1: Antonietti2010
  • Lemma 2: Antonietti2010 and Pazner2021b
  • Lemma 3
  • proof
  • Lemma 4
  • proof
  • Lemma 5: Cf. Pavarino1993
  • Lemma 6
  • ...and 32 more