2006
DOI: 10.1016/j.jcp.2005.08.022
|View full text |Cite
|
Sign up to set email alerts
|

High-order discontinuous Galerkin methods using an hp-multigrid approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
134
0
3

Year Published

2010
2010
2014
2014

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 149 publications
(139 citation statements)
references
References 33 publications
2
134
0
3
Order By: Relevance
“…Studies to date indicate that using a judicious choice of explicit and implicit smoothers at various multigrid levels may help to circumvent memory related issues whilst maintaining a suitable rate of convergence [85] [80]. Also, studies indicate that a combination of both p-multigrid and geometric multigrid may be beneficial [91].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Studies to date indicate that using a judicious choice of explicit and implicit smoothers at various multigrid levels may help to circumvent memory related issues whilst maintaining a suitable rate of convergence [85] [80]. Also, studies indicate that a combination of both p-multigrid and geometric multigrid may be beneficial [91].…”
Section: Discussionmentioning
confidence: 99%
“…It was also found that such an approach lead to convergence rates independent of solution polynomial order. In 2006 Nastase and Mavriplis [91] developed a mixed geometric/p-multigrid approach that utilized various implicit smoothers. Specifically, when the zeroth order p-multigrid level was reached a geometric multigrid approach was employed to further coarsen the discretization.…”
Section: Geometric Multigrid and P-multigrid Methodsmentioning
confidence: 99%
“…The semi-coarsening multigrid is used as smoother in the h-MGS-multigrid in Algorithm 2. Using (10)- (11) and assuming that L P 2 we obtain the following estimate for the number of operations in the LU-decompositions in Algorithm 2 14 3 NMm…”
Section: Computational Complexitymentioning
confidence: 99%
“…During the past decade also extensive research into efficient multigrid algorithms for discontinuous Galerkin discretizations has been conducted, see e.g. [1,3,[8][9][10][11]. This research is motivated by the strong need in industrial applications to reduce the computational cost of DG methods.…”
Section: Introductionmentioning
confidence: 99%
“…h-and/or p-multigrid preconditioners are known to work well for diffusion-dominated problems, and they have been applied in a DG context [28,18,24]. However, in this work, the ILUT(p, τ ) is considered for the obtuse meshes, and its efficiency is compared with the ILU(0) results on the acute and obtuse meshes.…”
Section: Preconditioning On Obtuse Meshesmentioning
confidence: 99%