2017
DOI: 10.1016/j.camwa.2017.06.025
|View full text |Cite
|
Sign up to set email alerts
|

Inexact hierarchical scale separation: A two-scale approach for linear systems from discontinuous Galerkin discretizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…The spatial discretization of the differential operators is obtained by applying the interior penalty discontinuous Galerkin method [33] with a hierarchical basis on each voxel. An efficient solution strategy for this type of discretization is proposed in [34]. For (3), (4), the scheme reduces to finite volumes for zeroth order polynomials.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The spatial discretization of the differential operators is obtained by applying the interior penalty discontinuous Galerkin method [33] with a hierarchical basis on each voxel. An efficient solution strategy for this type of discretization is proposed in [34]. For (3), (4), the scheme reduces to finite volumes for zeroth order polynomials.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Recall the nonnegativity of (Φ + ′ (y h + c 0 ), y h ) in (18). By the coercivity of a  , Cauchy-Schwarz's inequality, and Poincaré's inequality, we have…”
Section: Lemma 37mentioning
confidence: 99%
“…We again use (20) and (18). By the coercivity of a  , the inequality (18), Cauchy-Schwarz's inequality, Young's inequality, and Poincaré's inequality, we have that, for any r > 0:…”
Section: Lemma 37mentioning
confidence: 99%
See 1 more Smart Citation
“…Since DG basis functions are usually element-local (and often also hierarchical), the linear system can be trivially split into parts corresponding to different polynomial orders resulting in a scheme somewhat inspired by multigrid solvers, where different polynomial approximations on a fixed mesh play the role of fine and coarse mesh solutions of the classical multigrid. This approach can be carried out for each polynomial degree as in the p-multigrid method [7,8,9] or using a two scale technique as in the hierarchical scale separation (HSS) method or variations thereof [10,11,12,13]. Another common way to deal with this issue-and in many cases even to speed up the time-to-solution [14,15,16]-is to use hybridization.…”
Section: Introductionmentioning
confidence: 99%