11th International Conference on Numerical Methods in Fluid Dynamics
DOI: 10.1007/3-540-51048-6_61
|View full text |Cite
|
Sign up to set email alerts
|

Numerical analysis of a multigrid method for spectral approximations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…The early results on 1-D problems are encouraging and show optimal solver performance [13,14]. However, the extension to higher dimensions results in non-optimal performance due to the dependence of the convergence factor, q, of the multigrid iteration using a Jacobi smoother on the order of the polynomial basis, p. More precisely, q = 1Àc/p, where c is a constant independent of p [13]. It was shown that using a Chebyshev acceleration scheme resulted in the convergence factor being 1 À c= ffiffi ffi p p , but still not independent of p.…”
Section: Introductionmentioning
confidence: 70%
See 1 more Smart Citation
“…The early results on 1-D problems are encouraging and show optimal solver performance [13,14]. However, the extension to higher dimensions results in non-optimal performance due to the dependence of the convergence factor, q, of the multigrid iteration using a Jacobi smoother on the order of the polynomial basis, p. More precisely, q = 1Àc/p, where c is a constant independent of p [13]. It was shown that using a Chebyshev acceleration scheme resulted in the convergence factor being 1 À c= ffiffi ffi p p , but still not independent of p.…”
Section: Introductionmentioning
confidence: 70%
“…Once the polynomial order was reduced to p = 1, the traditional geometric multigrid algorithm could then be used. The early results on 1-D problems are encouraging and show optimal solver performance [13,14]. However, the extension to higher dimensions results in non-optimal performance due to the dependence of the convergence factor, q, of the multigrid iteration using a Jacobi smoother on the order of the polynomial basis, p. More precisely, q = 1Àc/p, where c is a constant independent of p [13].…”
Section: Introductionmentioning
confidence: 94%
“…Since V 1 h ⊂ V 2 h , by using (11), (13) and the compact support properties of {w i } i∈S a , we have…”
Section: Two-level Methods Based On Geometric Considerationmentioning
confidence: 99%
“…A year later, a paper by Maday and Muñoz [20] gave the convergence theory for the spectral element multigrid method. They proved that the convergence rate is independent of p in 1D, but in 2D it is O(1−c/ p) for some constant c. Other presentations of work by Rønquist, Patera, Maday, and Muñoz can be found in [21][22][23].…”
Section: Historymentioning
confidence: 99%