A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Iterative solution methods
ILUM: a multi-elimination ILU preconditioner for general sparse matrices
SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing
BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
Distributed Schur Complement Techniques for General Sparse Linear Systems
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Preconditioned multigrid simulation of an axisymmetric laminar diffusion flame
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
We present a fully parallel algorithm for constructing block independent set for general sparse matrices in a distributed environment. The block independent set is used in the construction of parallel multilevel preconditioners in solving large sparse matrices on distributed memory parallel computers. We compare a few implementations of the parallel multilevel ILU preconditioners with different block independent set construction strategies. Numerical experiments indicate that the parallel block independent set algorithm is effective in reducing both the parallel multilevel preconditioner construction time and the size of the last level reduced system.