A class of multilevel recursive incomplete LU preconditioning techniques

MaRDI QIDQ2731124zbMATH OpenFDO

Authors Jun Zhang

Publication date 11 April 2002

Published in The Korean Journal of Computational \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Krylov subspace methodmultigrid methodsmultilevel block incomplete LU factorizationpreconditioningSchur complementsparse systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06)

Recommendations

• 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

Cited in

(7)

• 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

Describes a project that uses

Uses Software

• BILUTM
• BILUM

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)