1993
DOI: 10.1017/s0962492900002385
|View full text |Cite
|
Sign up to set email alerts
|

Old and new convergence proofs for multigrid methods

Abstract: Multigrid methods axe the fastest known methods for the solution of the large systems of equations arising from the discretization of partial differential equations. For self-adjoint and coercive linear elliptic boundary value problems (with Laplace's equation and the equations of linear elasticity as two typical examples), the convergence theory reached a mature, if not its final state. The present article reviews old and new developments for this type of equation and describes the recent advances.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
164
0

Year Published

1995
1995
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 186 publications
(166 citation statements)
references
References 62 publications
2
164
0
Order By: Relevance
“…Hence, it follows that McCormick's analysis cannot prove optimal bounds for the V-cycle if the problem does not possess full regularity. Considering the results in [26], the same conclusions hold for Hackbusch's analysis [22, Section 7.2], and the SSC theory with a-orthogonal decomposition [16,17]. Thus, for the case when A k and A k M (2 ) k behave similarly with respect to the problem size, we show here that another type of analysis, as developed in, e.g.…”
Section: 2]) Thatsupporting
confidence: 75%
See 3 more Smart Citations
“…Hence, it follows that McCormick's analysis cannot prove optimal bounds for the V-cycle if the problem does not possess full regularity. Considering the results in [26], the same conclusions hold for Hackbusch's analysis [22, Section 7.2], and the SSC theory with a-orthogonal decomposition [16,17]. Thus, for the case when A k and A k M (2 ) k behave similarly with respect to the problem size, we show here that another type of analysis, as developed in, e.g.…”
Section: 2]) Thatsupporting
confidence: 75%
“…Thus, for the case when A k and A k M (2 ) k behave similarly with respect to the problem size, we show here that another type of analysis, as developed in, e.g. [13][14][15][16][17][18], is really needed to get uniform results for the V-cycle for problems with less than full regularity. …”
Section: 2]) Thatmentioning
confidence: 89%
See 2 more Smart Citations
“…For selfadjoint and coercive linear elliptic boundary value problems the convergence theory has reached a mature, if not its final state, cf. [14]. In other areas the state of the art is (far) less advanced.…”
Section: Introductionmentioning
confidence: 99%