2007
DOI: 10.1016/j.amc.2006.09.128
|View full text |Cite
|
Sign up to set email alerts
|

Improvement of the rate of convergence estimates for multigrid algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Nevertheless, the main defect of iterative methods is that these will work very well in a few iterations, but after that these methods will be converged slowly. Multi-grid algorithms will solve this problem (Bramble and Pasciak, 1987;Tavakoli and Kerayechian, 2007;Tavakoli, 2010). Multi-grid methods are the fastest known methods for the solution of the large systems of equations arising from the discretisation of partial differential equations (for more details see Bramble, 1993).…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless, the main defect of iterative methods is that these will work very well in a few iterations, but after that these methods will be converged slowly. Multi-grid algorithms will solve this problem (Bramble and Pasciak, 1987;Tavakoli and Kerayechian, 2007;Tavakoli, 2010). Multi-grid methods are the fastest known methods for the solution of the large systems of equations arising from the discretisation of partial differential equations (for more details see Bramble, 1993).…”
Section: Introductionmentioning
confidence: 99%
“…Various convergence proofs for multigrid algorithms has been widely presented so far ( [2,5]). Attempts has been accomplished for improvement of convergence rates ( [4,11]). However, less work has been done on the convergence of multigrid algorithms including an artificial damping.…”
Section: Introductionmentioning
confidence: 99%