# A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices

@article{Zhang2001AMD, title={A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices}, author={Jun Zhang}, journal={SIAM J. Matrix Anal. Appl.}, year={2001}, volume={22}, pages={925-947} }

A dual reordering strategy based on both threshold and graph reorderings is introduced to construct robust incomplete LU (ILU) factorization of indefinite matrices. The ILU matrix is constructed as a preconditioner for the original matrix to be used in a preconditioned iterative scheme. The matrix is first divided into two parts according to a threshold parameter to control diagonal dominance. The first part with large diagonal dominance is reordered using a graph-based strategy, followed by an…

## Figures and Tables from this paper

## 31 Citations

Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices

- Computer Science
- 2006

This work presents hybrid reordering strategies to deal with incomplete LU factorization preconditioning techniques, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm.

Distributed block independent set algorithms and parallel multilevel ILU preconditioners

- Computer ScienceJ. Parallel Distributed Comput.
- 2005

Incomplete factorization by local exact factorization (ILUE)

- Computer Science, MathematicsMath. Comput. Simul.
- 2018

HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from
PDEs

- Computer ScienceNumer. Linear Algebra Appl.
- 2021

To enable superior efficiency for large‐scale systems with millions or more unknowns, HILUCSI introduces a scalability‐oriented dropping in conjunction with a variant of inverse‐based dropping, and it is shown that this combination improves robustness for indefinite systems without compromising efficiency.

A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices

- Computer ScienceComput. Math. Appl.
- 2009

Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization

- Computer ScienceArXiv
- 2008

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.

HILUCSI: Simple, Robust, and Fast Multilevel ILU with Mixed Symmetric and Unsymmetric Processing

- Computer ScienceArXiv
- 2019

The robustness and efficiency of HILUCSI are demonstrated for benchmark problems from a wide range of applications against ILUPACK, the supernodal ILUTP in SuperLU, and multithreaded direct solvers in PARDISO and MUMPS.

Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations

- Computer ScienceACM/IEEE SC 2003 Conference (SC'03)
- 2003

The use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditionsers is investigated to enhance the robustness of SAI for solving difficult problems.

Parallel multilevel block ILU preconditioning techniques for large sparse linear systems

- Computer ScienceProceedings International Parallel and Distributed Processing Symposium
- 2003

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…

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

- Computer ScienceParallel Comput.
- 2002

## References

SHOWING 1-10 OF 68 REFERENCES

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

- Computer ScienceSIAM J. Matrix Anal. Appl.
- 1999

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.

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

- Computer ScienceSIAM J. Sci. Comput.
- 1996

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.

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

- Computer ScienceNumer. Linear Algebra Appl.
- 1999

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.

An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems

- Computer ScienceInformatica
- 2000

A direct method is currently more appropriate than an iterative method for a general-purpose black-box nonsymmetric linear solver and pivoting is even more important for incomplete than for complete factorizations.

Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems

- Computer Science
- 2001

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

- Computer ScienceAppl. Math. Comput.
- 2001

Conjugate gradient methods and ILU preconditioning of non‐symmetric matrix systems with arbitrary sparsity patterns

- Computer Science
- 1989

On the stability of the incomplete LU-factorizations
and characterizations of H-matrices

- Mathematics
- 1995

Summary.
Meijerink and van der Vorst [8] have
shown that the incomplete LU-factorizations are numerically stable for M-matrices. Varga, Saff and
Mehrmann [16] gave some characterizations of the…

Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

- Computer Science
- 1976

It is proved that for band elimination methods, the two orderings are equivalent and that, surprisingly, the reverse ordering is always at least as good as the original one when envelope elimination techniques are used.