2008
DOI: 10.1137/07069691x
|View full text |Cite
|
Sign up to set email alerts
|

A Multilevel Preconditioner for the Interior Penalty Discontinuous Galerkin Method

Abstract: In this article we present a multilevel preconditioner for interior penalty discontinuous Galerkin discretizations of second order elliptic boundary value problems that gives rise to uniformly bounded condition numbers without any additional regularity assumptions on the solution. The underlying triangulations are only assumed to be shape regular but may have hanging nodes subject to certain mild grading conditions. A key role is played by certain decompositions of the discontinuous trial space into a conformi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
27
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(28 citation statements)
references
References 20 publications
1
27
0
Order By: Relevance
“…Due to the symmetry of the bilinear form a T (·, ·), conjugate gradient methods may be used to solve (2.11). Multilevel preconditioners are studied in [30,19] but, for simplicity, we assume that U is computed exactly.…”
Section: The Adaptive Procedurementioning
confidence: 99%
“…Due to the symmetry of the bilinear form a T (·, ·), conjugate gradient methods may be used to solve (2.11). Multilevel preconditioners are studied in [30,19] but, for simplicity, we assume that U is computed exactly.…”
Section: The Adaptive Procedurementioning
confidence: 99%
“…For simplicity, we may take small constant penalty parameters for OPSIPG scheme. Based on the estimate (11), then we have the following lemma for (8).…”
Section: Some Estimates Of the Opsipg Schemementioning
confidence: 99%
“…The OPSIPG and WOPSIP methods produce an ill-conditioned discrete system, which results from the over-penalization terms. Fortunately, it can be remedied by a simple block-diagonal preconditioner (see [6]) and a multilevel preconditioner in [8]. Now the main question lies in how to implement the PPR technique into discontinuous Galerkin solutions under the framework of discontinuous Galerkin finite element methods.…”
Section: Introductionmentioning
confidence: 99%
“…The p-multigrid (synonymously spectral multigrid [1], hierarchic multigrid [2], or multi-level method [3]) algorithm originally proposed by Rönquist and Patera [1] is an iterative technique to solve hp-finite element discretizations of equations. After a dormant period of more than a decade, the method has received renewed interest in recent works by Helenbrook et al [4], Helenbrook and Atkins [5,6], Fidkowski et al [7], Oliver [8] and Luo et al [9].…”
Section: Introductionmentioning
confidence: 99%