Table of Contents
Fetching ...

A generalized Hessian-based error estimator for an IPDG formulation of the biharmonic problem in two dimensions

Théophile Chaumont-Frelet, Joscha Gedicke, Lorenzo Mascotto

TL;DR

This work advances a posteriori error estimation for symmetric IPDG discretizations of the 2D biharmonic problem by introducing a generalized Hessian H_h that combines the broken Hessian with a lifting operator. A regular decomposition of the div-div complex yields a splitting of the Hessian error into conforming and nonconforming parts, enabling a stable, stabilization-free error estimator η. The authors prove reliability and efficiency bounds for η (with p-dependent conditions) and show that η can be controlled by the standard DG residual estimator, while numerical tests confirm matching convergence rates and effective adaptive refinements. The approach promises potential simplifications in adaptive convergence proofs and provides a pathway to p-dependent refinements and nontrivial topology extensions in 2D (with possible extensions to 3D).

Abstract

We consider a two dimensional biharmonic problem and its discretization by means of a symmetric interior penalty discontinuous Galerkin method. A novel split of an error measure based on a generalized Hessian into two terms measuring the conformity and nonconformity of the scheme is proven. This splitting is the departing point for the design of a new error estimator, which is provably reliable and efficient for polynomial degree larger than~$3$, and does not involve any DG stabilization. Such an error estimator can be bounded from above by the standard DG residual error estimator. Numerical results assess the theoretical predictions, including the efficiency of the proposed estimator, for all polynomial degrees larger than or equal to~$2$.

A generalized Hessian-based error estimator for an IPDG formulation of the biharmonic problem in two dimensions

TL;DR

This work advances a posteriori error estimation for symmetric IPDG discretizations of the 2D biharmonic problem by introducing a generalized Hessian H_h that combines the broken Hessian with a lifting operator. A regular decomposition of the div-div complex yields a splitting of the Hessian error into conforming and nonconforming parts, enabling a stable, stabilization-free error estimator η. The authors prove reliability and efficiency bounds for η (with p-dependent conditions) and show that η can be controlled by the standard DG residual estimator, while numerical tests confirm matching convergence rates and effective adaptive refinements. The approach promises potential simplifications in adaptive convergence proofs and provides a pathway to p-dependent refinements and nontrivial topology extensions in 2D (with possible extensions to 3D).

Abstract

We consider a two dimensional biharmonic problem and its discretization by means of a symmetric interior penalty discontinuous Galerkin method. A novel split of an error measure based on a generalized Hessian into two terms measuring the conformity and nonconformity of the scheme is proven. This splitting is the departing point for the design of a new error estimator, which is provably reliable and efficient for polynomial degree larger than~, and does not involve any DG stabilization. Such an error estimator can be bounded from above by the standard DG residual error estimator. Numerical results assess the theoretical predictions, including the efficiency of the proposed estimator, for all polynomial degrees larger than or equal to~.

Paper Structure

This paper contains 21 sections, 10 theorems, 137 equations, 4 figures, 2 tables.

Key Result

Proposition 2.1

For any $\underline{\mathbf B}$ in $\underline{\mathbf H}_{\underline{\mathbf S}}(\mathop{\mathrm{\mathop{\mathrm{div}}\nolimits\mathop{\mathrm{\bf div}}\nolimits}}\nolimits,\Omega)$, there exists a positive constant $C$ such that The two trace operators above admit continuous right-inverses.

Figures (4)

  • Figure 1: Effectivity indices in \ref{['effectivity-indices']}. Test case with exact solution $u_1$ in \ref{['u1']}; $p=2,3,4,5$; uniform mesh refinements. Left-panel: effectivity index $\mathfrak F_{\mathop{\mathrm{\underline{\mathbf H}_{\mathop{\mathrm{h}}\nolimits}}}\nolimits}$. Right-panel: effectivity index $\mathfrak F_{\rm DG}$.
  • Figure 2: Effectivity indices in \ref{['effectivity-indices']}. Test case with exact solution $u_1$ in \ref{['u1']}; $p=6,7,8,9$; uniform mesh refinements. Left-panel: effectivity index $\mathfrak F_{\mathop{\mathrm{\underline{\mathbf H}_{\mathop{\mathrm{h}}\nolimits}}}\nolimits}$. Right-panel: effectivity index $\mathfrak F_{\rm DG}$.
  • Figure 3: Effectivity indices in \ref{['effectivity-indices']}. Test case with exact solution $u_1$ in \ref{['u1']}; fixed structured mesh of $6$ triangles; $p$-refinement. Effectivity indices $\mathfrak F_{\mathop{\mathrm{\underline{\mathbf H}_{\mathop{\mathrm{h}}\nolimits}}}\nolimits}$ and $\mathfrak F_{\rm DG}$ in \ref{['effectivity-indices']}.
  • Figure 4: Test case with exact solution $u_1$ in \ref{['u1']}; $p=2,5$; uniform and adaptive mesh refinements. Left-panel: $\left\Vert \mathop{\mathrm{\underline{\mathbf D}^2}}\nolimits u - \mathop{\mathrm{\underline{\mathbf H}_{\mathop{\mathrm{h}}\nolimits}}}\nolimits(\mathop{\mathrm{u_{\mathop{\mathrm{h}}\nolimits}}}\nolimits) \right\Vert_{\Omega}$; the adaptive algorithm is driven by the error estimator in \ref{['error-estimator']}. Right-panel: $\left\Vert u - \mathop{\mathrm{u_{\mathop{\mathrm{h}}\nolimits}}}\nolimits \right\Vert_{\rm DG}$; the adaptive algorithm is driven by the error estimator in \ref{['DG-error-estimator']}.

Theorems & Definitions (22)

  • Proposition 2.1
  • Lemma 3.1
  • Lemma 3.2
  • Remark 3.3
  • Remark 3.4
  • Lemma 4.1
  • Proposition 4.2
  • proof
  • Remark 4.3
  • Remark 5.1
  • ...and 12 more