2016
DOI: 10.1007/978-3-319-39929-4_17
|View full text |Cite
|
Sign up to set email alerts
|

Stable Discontinuous Galerkin FEM Without Penalty Parameters

Abstract: We propose a modified local discontinuous Galerkin (LDG) method for second-order elliptic problems that does not require extrinsic penalization to ensure stability. Stability is instead achieved by showing a discrete Poincaré-Friedrichs inequality for the discrete gradient that employs a lifting of the jumps with one polynomial degree higher than the scalar approximation space. Our analysis covers rather general simplicial meshes with the possibility of hanging nodes.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…is the space composed of homogeneous polynomials of degree k, or (ii) the (larger) polynomial space P k+1 d (T ; R d×d ). For both choices, we prove, using the ideas in [28], that the reconstructed gradient is stable, thereby circumventing the need to introduce and tune any stabilization parameter. Reconstructing the gradient in RTN k d (T ; R d×d ) leads to optimal O(h k+1 )convergence rates for linear problems and smooth solutions, Instead, reconstructing the gradient in P k+1 d (T ; R d×d ) leads to O(h k )-convergence rates for linear problems and smooth solutions, i.e., the method still converges but at a suboptimal order in ideal situations.…”
Section: Introductionmentioning
confidence: 99%
“…is the space composed of homogeneous polynomials of degree k, or (ii) the (larger) polynomial space P k+1 d (T ; R d×d ). For both choices, we prove, using the ideas in [28], that the reconstructed gradient is stable, thereby circumventing the need to introduce and tune any stabilization parameter. Reconstructing the gradient in RTN k d (T ; R d×d ) leads to optimal O(h k+1 )convergence rates for linear problems and smooth solutions, Instead, reconstructing the gradient in P k+1 d (T ; R d×d ) leads to O(h k )-convergence rates for linear problems and smooth solutions, i.e., the method still converges but at a suboptimal order in ideal situations.…”
Section: Introductionmentioning
confidence: 99%
“…We consider the choices θ " 1, β " 0, and γ " 0 yielding the symmetric interior penalty method (SIPG) [DD76], θ "´1, β " 0, and γ " 0 which gives the nonsymmetric interior penalty methods (NIPG) [RWG99], and θ " 1, β P R d , and γ " 1 which yields the local discontinuous Galerkin method (LDG) [CS98]; compare also with [ABCM02] and [JNS16]. In all three cases, the corresponding discontinuous Galerkin finite element method (DGFEM) then reads: find u G P VpGq such that…”
Section: The Adgm and The Main Resultsmentioning
confidence: 99%
“…Indeed, we can immediately apply a convergence and error estimate result derived from the Gradient Discretisation Method framework. This approach is different from that of [4] where a specific stabilisation term is introduced in the variational formulation, whereas the present work has significant common points with the stable DG method without penalty parameter proposed in [15] (where a scheme, which can enter into the GDM, is proposed, the main difference with the present paper being the lifting of the jumps for computing the discrete gradient).…”
Section: Introductionmentioning
confidence: 83%
“…Let us first state and prove the following lemma, which provides a connection between the discrete gradient defined by (15) to a norm suited for the study of discontinuous Galerkin methods in the framework of elliptic problems.…”
Section: Mathematical Properties Of the Dggd Methodsmentioning
confidence: 99%