Distributed block independent set algorithms and parallel multilevel ILU preconditioners

@article{Shen2005DistributedBI,
  title={Distributed block independent set algorithms and parallel multilevel ILU preconditioners},
  author={Chi Shen and Jun Zhang and Kai Wang},
  journal={J. Parallel Distributed Comput.},
  year={2005},
  volume={65},
  pages={331-346}
}

Figures and Tables from this paper

A Class of Parallel Multilevel Sparse Approximate Inverse Preconditioners for Sparse Linear Systems

TLDR
The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems and to reduce the storage cost of the multileVEL preconditioners.

Performance Study and Analysis of Parallel Multilevel Preconditioners

TLDR
Two performance prediction models are built that combine theoretical features of the preconditioners with estimates on computation cost, communications overhead, etc and show that their model predication based on certain reasonable assumptions is close to the simulation results.

Preconditioning Techniques for a Newton-Krylov Algorithm for the Compressible Navier-Stokes Equations

TLDR
Experiments for inviscid, laminar and turbulent cases are presented to show the effectiveness of iterative BILU preconditioning in terms of reducing the number of GMRES iterations, and hence the memory requirements of the Newton–Krylov algorithm.

Unstructured Meshes and Finite Elements in Space Plasma Modelling: Principles and Applications

This chapter describes the general principles of unstructured mesh generation in two and three dimensions, together with the use of finite elements in modelling space plasmas. Particular attention is

References

SHOWING 1-10 OF 61 REFERENCES

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

A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices

  • Jun Zhang
  • Computer Science
    Appl. Math. Comput.
  • 2001

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.

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.

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.

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.

ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices

  • Y. Saad
  • Computer Science
    SIAM J. Sci. Comput.
  • 1996
TLDR
The ILUM factorization described in this paper can be viewed as a multifrontal version of a Gaussian elimination procedure with threshold dropping which has a high degree of potential parallelism.
...