Parallel multilevel block ILU preconditioning techniques for large sparse linear systems

@article{Shen2003ParallelMB,
  title={Parallel multilevel block ILU preconditioning techniques for large sparse linear systems},
  author={Chi Shen and Jun Zhang and Kai Wang},
  journal={Proceedings International Parallel and Distributed Processing Symposium},
  year={2003},
  pages={8 pp.-}
}
  • Chi Shen, Jun Zhang, Kai Wang
  • Published 22 April 2003
  • Computer Science
  • Proceedings International Parallel and Distributed Processing Symposium
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU)factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We compare a few implementations of the parallel multilevel ILU preconditioners with different block… 

Figures and Tables from this paper

Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization

TLDR
This paper presents the first highly scalable parallelILU(k) algorithm, which achieves 50 times speedup with 80 nodes for general sparse matrices of dimension 160,000 that are diagonally dominant.

Incomplete selected inversion for linear-scaling electronic structure calculations

TLDR
The resulting incomplete PEXSI (iPEXSI) algorithm is the first linear-scaling algorithm which scales provably better than cubically even in the absence of localization, and it is hoped that this will help to further lower the critical system size where linear- scaling algorithms begin to outperform the diagonalization algorithm.

A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory

TLDR
TPILU(k), the first efficiently parallelized ILU( k) preconditioner that maintains this important stability property, is presented, which shows the ability to efficiently take advantage of many cores will become ever more important as the authors approach an era of many-core computing.

References

SHOWING 1-10 OF 18 REFERENCES

Parallel two level block ILU preconditioning techniques for solving large sparse linear systems

A class of multilevel recursive incomplete LU preconditioning techniques

TLDR
A class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices based on a recursive two by two block incomplete LU factorization on the coefficient matrix is introduced.

Distributed Schur Complement Techniques for General Sparse Linear Systems

TLDR
This paper presents a few preconditioning techniques for solving general sparse linear systems on distributed memory environments, which consist of an approximate solution process for the global system, which exploits approximate LU factorizations for diagonal blocks of the Schur complement.

BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices

TLDR
This implementation is efficient in controlling the fill-in elements during the multilevel block ILU factorization, especially when large size blocks are used in domain decomposition-type implementations.

BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems

TLDR
Block versions of the multielimination incomplete LU (ILUM) factorization preconditioning technique for solving general sparse unstructured linear systems are introduced and tests show that it may be possible to obtain convergence that is nearly independent of the Reynolds number as well as of the grid size.

Parallel Threshold-based ILU Factorization

TLDR
This work presents a highly parallel formulation of the ILUT(m, t) threshold-based incomplete factorization algorithm that utilizes parallel multilevel k-way partitioning and parallel independent set computation algorithms to effectively parallelize both the factorization as well as the application of the preconditioner.

Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems

TLDR
Techniques based on diagonal threshold tolerance when developing multi-elimination and multi-level incomplete LU (ILUM) factorization precondi-tioners for solving general sparse linear systems are introduced.

On Preconditioning Schur Complement and Schur Complement Preconditioning

We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first

A stability analysis of incomplete LU factorizations

  • H. Elman
  • Computer Science, Mathematics
  • 1986
Abstract : The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising

ARMS: an algebraic recursive multilevel solver for general sparse linear systems

TLDR
A general preconditioning method based on a multilevel partial elimination approach that provides a common framework for many other techniques and can be fairly robust.