A convergence analysis of two-grid methods based on coarsening by (unsmoothed) aggregation is presented. For diagonally dominant symmetric (M-)matrices, it is shown that the analysis can be conducted locally; that is, the convergence factor can be bounded above by computing separately for each aggre
✦ LIBER ✦
Energy Optimization of Algebraic Multigrid Bases
✍ Scribed by J. Mandel; M. Brezina; P. Vaněk
- Book ID
- 106202915
- Publisher
- Springer Vienna
- Year
- 1999
- Tongue
- English
- Weight
- 155 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Algebraic analysis of aggregation-based
✍
Artem Napov; Yvan Notay
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 347 KB
Operator-based interpolation for bootstr
✍
T. Manteuffel; S. McCormick; M. Park; J. Ruge
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 148 KB
Convergence of algebraic multigrid based
✍
Petr Vanvek; Marian Brezina; Jan Mandel
📂
Article
📅
2001
🏛
Springer-Verlag
🌐
English
⚖ 173 KB
On an energy minimizing basis for algebr
✍
Jinchao Xu; Ludmil Zikatanov
📂
Article
📅
2004
🏛
Springer-Verlag
🌐
English
⚖ 849 KB
Algebraic analysis of multigrid algorith
✍
Christoph Pflaum
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 158 KB
👁 2 views
We study the convergence rate of multilevel algorithms from an algebraic point of view. This requires a detailed analysis of the constant in the strengthened Cauchy-Schwarz inequality between the coarse-grid space and a so-called complementary space. This complementary space may be spanned by standa
AV-cycle Multigrid for multilevel matrix
✍
Antonio Aricò; Marco Donatelli
📂
Article
📅
2007
🏛
Springer-Verlag
🌐
English
⚖ 615 KB