A class of multilevel recursive incomplete LU preconditioning techniques
Preconditioners based on multilevel block incomplete LU factorization (BILUM) have been shown to possess certain properties that are typically enjoyed by multigrid methods. They are faster and more robust than traditional LU precoditioners. This paper extends BILUM techniques to multilevel recursive ILU preconditioning techniques for solving general sparse systems. This technique is based on a recursive two by two block ILU factorization on the coefficient matrix. The coarse level system is constructed as an Schur complement. A dynamic preconditioner is obtained by solving the Schur complement matrix approximately by a preconditioned Krylov subspace method. This class of preconditioners may be highly robust and scalable.
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- BILUS: A block version of ILUS factorization.
- Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems
- Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices
- Recursive two-level ILU preconditioner for nonsymmetric M-matrices
- AINV and BILUM preconditioning techniques
- A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- scientific article; zbMATH DE number 434802 (Why is no real title available?)
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems
This page was built for publication: A class of multilevel recursive incomplete LU preconditioning techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731124)