Discrete Poincaré and trace inequalities for the hybridizable discontinuous Galerkin method

Abstract In this paper, we derive discrete Poincaré and trace inequalities for the hybridizable discontinuous Galerkin (HDG) method. We employ the Crouzeix-Raviart space as a bridge, connecting classical discrete functional tools from Brenner’s foundational work (Brenner, S.C.: SIAM J. Numer. Anal. 41 (1), 306–324 (2003)) with hybridizable finite element spaces comprised of piecewise polynomial functions defined both within the element interiors and on the mesh skeleton. This approach yields custom-tailored inequalities that underpin the stability analysis of HDG discretizations. The resulting framework is then used to demonstrate the well-posedness and robustness of HDG-based numerical schemes for second-order elliptic problems, even under minimal regularity assumptions on the source term and boundary data.

Authors

Institutions

Publication Details

Journal
BIT Numerical Mathematics
Published
2026-02-02
DOI
https://doi.org/10.1007/s10543-025-01105-5
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

Discrete Poincaré and trace inequalities for the hybridizable discontinuous Galerkin method

Yukun Yue
BIT Numerical Mathematics
Advanced Numerical Methods in Computational Mathematics
article

Discrete Poincaré and trace inequalities for the hybridizable discontinuous Galerkin method

Yukun Yue
article en

Abstract

Abstract In this paper, we derive discrete Poincaré and trace inequalities for the hybridizable discontinuous Galerkin (HDG) method. We employ the Crouzeix-Raviart space as a bridge, connecting classical discrete functional tools from Brenner’s foundational work (Brenner, S.C.: SIAM J. Numer. Anal. 41 (1), 306–324 (2003)) with hybridizable finite element spaces comprised of piecewise polynomial functions defined both within the element interiors and on the mesh skeleton. This approach yields custom-tailored inequalities that underpin the stability analysis of HDG discretizations. The resulting framework is then used to demonstrate the well-posedness and robustness of HDG-based numerical schemes for second-order elliptic problems, even under minimal regularity assumptions on the source term and boundary data.

BIT Numerical MathematicsVol. 66(1)
University of Wisconsin–Madison (US)
National Science Foundation
Reduced inequalities
Openalex Percentile: Top 67%
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.