On the Compact Discontinuous Galerkin Method for Polytopal Meshes

Abstract. The compact discontinuous Galerkin method was introduced by Peraire and Persson in (SIAM J. Sci. Comput., 30, 1806–1824, 2008). In this work, we present the stability and convergence analysis for the [Formula: see text]-version of this method applied to elliptic problems on polytopal meshes. Moreover, we introduce fast and practical algorithms that allow the CDG, LDG, and BR2 methods to be implemented within a unified framework. Our numerical experiments show that the CDG method yields a compact stencil for the stiffness matrix, with faster assembly and solving times compared to the LDG and BR2 methods. We numerically study how coercivity depends on the method parameters for various mesh types, with particular focus on the number of facets per mesh element. Finally, we demonstrate the importance of choosing the correct directions for the numerical fluxes when using variable polynomial degrees.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2026-10-28
DOI
https://doi.org/10.1137/26m184057x
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

On the Compact Discontinuous Galerkin Method for Polytopal Meshes

Sergio Gómez, Mattia Corti
1 links
SIAM Journal on Scientific Computing
Advanced Numerical Methods in Computational Mathematics
article

On the Compact Discontinuous Galerkin Method for Polytopal Meshes

Sergio Gómez, Mattia Corti
article en

Abstract

Abstract. The compact discontinuous Galerkin method was introduced by Peraire and Persson in (SIAM J. Sci. Comput., 30, 1806–1824, 2008). In this work, we present the stability and convergence analysis for the [Formula: see text]-version of this method applied to elliptic problems on polytopal meshes. Moreover, we introduce fast and practical algorithms that allow the CDG, LDG, and BR2 methods to be implemented within a unified framework. Our numerical experiments show that the CDG method yields a compact stencil for the stiffness matrix, with faster assembly and solving times compared to the LDG and BR2 methods. We numerically study how coercivity depends on the method parameters for various mesh types, with particular focus on the number of facets per mesh element. Finally, we demonstrate the importance of choosing the correct directions for the numerical fluxes when using variable polynomial degrees.

SIAM Journal on Scientific ComputingVol. 48(5)
University of Vienna (AT), Istituto di Matematica Applicata e Tecnologie Informatiche (IT), University of Milano-Bicocca (IT), Politecnico di Milano (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", European Commission, Austrian Science Fund, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 96%
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.

Laika access coming soon