Optimal V-cycle algebraic multilevel preconditioning

DOI10.1002/(SICI)1099-1506(199809/10)5:5%3C441::AID-NLA147%3E3.0.CO;2-JMaRDI QIDQ2713565zbMATH OpenFDO

Authors Yvan Notay

Publication date 10 June 2001

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/(SICI)1099-1506(199809/10)5:5%3C441::AID-NLA147%3E3.0.CO;2-J

zbMATH Keywords

condition numberconvergence accelerationiterative methodsmultigrid algorithmsnumerical experimentspreconditioningSchur complementsparse matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Review text

This paper deals with the iterative solution of large sparse symmetric positive (non-negative) definite linear systems arising from the discretization of second order elliptic partial differential equations. The author considers algebraic multilevel preconditioning methods based on the recursive use of a \(2\times 2\) block incomplete factorization procedure in which the Schur complement is approximated by a coarse grid matrix. The combination of these techniques with a smoothing procedure which is much the same as the one used in standard multigrid algorithms, except that smoothing is not required on the finest grid, is analyzed. NEWLINENEWLINENEWLINEThe theoretical results prove optimal convergence properties for the V-cycle under an assumption similar to the `approximation property' of the classical multigrid convergence theory. On the other hand, the presented numerical experiments made on both 2D and 3D problems show that the condition number is close to that of the two-level method. Further, the method appears to be robust in the presence of discontinuity and anisotropy, even when the material interfaces are not aligned with the coarse grid.

Recommendations

• Publication:3203982
• Hybrid V-Cycle Algebraic Multilevel Preconditioners
• On hybrid v-cycle version (i) algebraic multilevel preconditionings
• scientific article; zbMATH DE number 4106119
• On algebraic multilevel preconditioning
• scientific article; zbMATH DE number 871571
• On algebraic multilevel preconditioning methods
• A V-cycle multigrid for multilevel matrix algebras: proof of optimality
• New variants of the algebraic multilevel preconditioning methods
• scientific article; zbMATH DE number 880650

Cited in

(12)

• Implementation strategies for block recursive factorizations
• Iterative solution methods
• Algebraic multilevel iteration method for lowest order Raviart-Thomas space and applications
• An optimal block iterative method and preconditioner for banded matrices with applications to PDEs on irregular domains
• On Multilevel Preconditioners which are Optimal with Respect to Both Problem and Discretization Parameters
• A robust algebraic multilevel preconditioner for non-symmetricM-matrices
• On hybrid v-cycle version (i) algebraic multilevel preconditionings
• Additive Schur complement approximation and application to multilevel preconditioning
• Robust parameter‐free algebraic multilevel preconditioning
• A review of algebraic multigrid
• Finite-element based sparse approximate inverses for block-factorized preconditioners
• The effect of approximate coarsest-level solves on the convergence of multigrid V-cycle methods

This page was built for publication: Optimal V-cycle algebraic multilevel preconditioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713565)