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
Efficient Algebraic Multigrid Algorithms and Their Convergence
β Scribed by Chang, Qianshun; Huang, Zhaohui
- Book ID
- 118189523
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2002
- Tongue
- English
- Weight
- 222 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1064-8275
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
V -cycle, F -cycle and W -cycle multigrid algorithms for interior penalty methods for second order elliptic boundary value problems are studied in this paper. It is shown that these algorithms converge uniformly with respect to all grid levels if the number of smoothing steps is sufficiently large,
An algebraic multigrid (AMG) scheme is presented for the efficient solution of large systems of coupled algebraic equations involving second-order discrete differentials. It is based on elementary (zero-order) intergrid transfer operators but exhibits convergence rates that are independent of the sy