A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Vorticity-velocity formulation for three-dimensional steady compressible flows
Journal of Computational Physics
Parallel domain-oriented multilevel methods
SIAM Journal on Scientific Computing
ILUM: a multi-elimination ILU preconditioner for general sparse matrices
SIAM Journal on Scientific Computing
Experimental study of ILU preconditioners for indefinite matrices
Journal of Computational and Applied Mathematics
SIAM Journal on Scientific Computing
Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
On the Approximate Cyclic Reduction Preconditioner
SIAM Journal on Scientific Computing
Distributed Schur Complement Techniques for General Sparse Linear Systems
SIAM Journal on Scientific Computing
A multigrid tutorial: second edition
A multigrid tutorial: second edition
Semicoarsening Multigrid on Distributed Memory Machines
SIAM Journal on Scientific Computing
Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems
Journal of Computational and Applied Mathematics
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
SIAM Journal on Matrix Analysis and Applications
A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices
SIAM Journal on Matrix Analysis and Applications
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Journal of Computational Physics
Hi-index | 0.01 |
We present a class of parallel preconditioning strategies utilizing multilevel block incomplete LU (ILU) factorization techniques to solve large sparse linear systems. The preconditioners are constructed by exploiting the concept of block independent sets (BISs). Two algorithms for constructing BISs of a sparse matrix in a distributed environment are proposed. We compare a few implementations of the parallel multilevel ILU preconditioners with different BIS construction strategies and different Schur complement preconditioning strategies. We also use some diagonal thresholding and perturbation strategies for the BIS construction and for the last level Schur complement ILU factorization. Numerical experiments indicate that our domain-based parallel multilevel block ILU preconditioners are robust and efficient.