W 1,p error estimates of an IPDG and a class of HDG methods for the Poisson problem on convex polyhedral domains
math.NA, cs.NA
Submitted: 2026-10-30
Updated: 2026-10-30
License: http://creativecommons.org/licenses/by/4.0/
The gist: This paper analyzes a symmetric interior penalty discontinuous Galerkin (IPDG) method, a hybrid mixed DG method…
Abstract
This paper analyzes a symmetric interior penalty discontinuous Galerkin (IPDG) method, a hybrid mixed DG method, and two representative hybridizable discontinuous Galerkin (HDG) methods for the Poisson problem on convex polyhedral domains. For any fixed ε in (0, 1 over 2), we first derive optimal discrete W 1,p error estimates for 2 at most p< ε by combining the interface Green's functions developed in with the Fubini-type weighted estimates established in this paper. These error estimates lead to discrete W 1,q - W 1,p inf-sup stability for 2 at most q< ε, where q is the conjugate number of p such that 1 over p+ 1 over q=1. Using this stability result and a suitably constructed dual problem, we extend the optimal error estimates to 1 over 1-ε<p<2 and subsequently establish the corresponding inf-sup stability for 1 over 1-ε< q<2. Thus, both optimal discrete W 1,p error estimates and discrete W 1,q - W 1,p inf-sup stability hold throughout the range 1 over 1-ε<p< ε, with q=p/(p-1). Note that all of the aforementioned results are free of logarithmic factors and also hold on polyhedral meshes (except for the hybrid mixed DG method). Compared with the conforming finite element method (FEM), establishing such error estimates and inf-sup stability results for DG methods on convex polyhedral domains is more delicate because their analysis involves mesh-dependent norms. Consequently, the operator interpolation theory employed for conforming FEMs cannot be directly applied to DG methods. Finally, a numerical example is presented to illustrate the theoretical results.
Sources
- A unified analysis of maximum-norm estimates for a class of HDG methods for parabolic problem in polyhedral domains
- An Interface Green's Function Framework for Complete Discrete $W^{1,\infty}$ Analysis of Discontinuous Galerkin Methods
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers