Using approximate inverses in algebraic multilevel methods

DOI10.1007/s002110050373zbMath0911.65027OpenAlexW2016886601MaRDI QIDQ1272813

Yvan Notay

Publication date: 2 March 1999

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050373

zbMATH Keywords

numerical examplesSchur complementpreconditioningcondition numberconvergence rateiterative solutionapproximate inversealgebraic multilevel methodslarge sparse symmetric positive definite systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (9)

Recursive two-level ILU preconditioner for nonsymmetric M-matrices ⋮ Multilevel block ILU preconditioner for sparse nonsymmetric \(M\)-matrices. ⋮ Finite-element based sparse approximate inverses for block-factorized preconditioners ⋮ A review of algebraic multigrid ⋮ Iterative solution methods ⋮ A robust algebraic multilevel preconditioner for non-symmetricM-matrices ⋮ Robust multilevel methods for quadratic finite element anisotropic elliptic problems ⋮ Implementation strategies for block recursive factorizations ⋮ Preconditioning techniques for large linear systems: A survey

This page was built for publication: Using approximate inverses in algebraic multilevel methods