# Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices

@article{Zhang2000SparseAI, title={Sparse approximate inverse and multilevel block ILU preconditioning techniques for general sparse matrices}, author={Jun Zhang}, journal={Applied Numerical Mathematics}, year={2000}, volume={35}, pages={67-86} }

## Figures and Tables from this paper

## 28 Citations

### Multigrid treatment and robustness enhancement for factored sparse approximate inverse preconditioning

- Computer Science
- 2002

### 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.

### Robust parallel ILU preconditioning techniques for solving large sparse matrices

- Computer ScienceProceedings 16th International Parallel and Distributed Processing Symposium
- 2002

A parallel preconditioner for solving general sparse linear systems based on a two level block ILU factorization strategy is implemented and is fast and robust for solving certain large sparse matrices.

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

- Computer ScienceParallel Comput.
- 2002

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

- Computer ScienceScalable Comput. Pract. Exp.
- 2006

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.

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

- Computer ScienceAppl. Math. Comput.
- 2001

### A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices

- Computer ScienceAppl. Math. Comput.
- 2002

### A Sparse Approximate Inverse Technique for ParallelPreconditioning of General Sparse Matrices

- Computer Science
- 1998

A sparse approximate inverse technique is introduced to solve general sparse linear systems and possesses much greater inherent parallelism than traditional preconditioners based on incomplete LU factorizations.

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

- Computer Science
- 2001

### 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.

## References

SHOWING 1-10 OF 52 REFERENCES

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

- Computer ScienceSIAM J. Sci. Comput.
- 1999

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 Preconditioning with Sparse Approximate Inverses

- Computer ScienceSIAM J. Sci. Comput.
- 1997

A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to anâ€¦

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

- Computer Science
- 2001

### 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.

### A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

- Computer ScienceSIAM J. Sci. Comput.
- 1998

A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient--type methods.

### Approximate Inverse Preconditioners via Sparse-Sparse Iterations

- Computer ScienceSIAM J. Sci. Comput.
- 1998

Newton, "global," and column-oriented algorithms, and options for initial guesses, self-preconditioning, and dropping strategies are discussed, and some limited theoretical results on the properties and convergence of approximate inverses are derived.

### Approximate Inverse Techniques for Block-Partitioned Matrices

- Computer ScienceSIAM J. Sci. Comput.
- 1997

This paper proposes some preconditioning options when the system matrix is in block-partitioned form, which can help solve difficult linear systems whose coefficient matrices are highly indefinite.

### 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.

### Factorized sparse approximate inverse preconditionings I: theory

- Computer Science
- 1993

This paper considers construction and properties of factorized sparse approximate inverse preconditionings well suited for implementation on modern parallel computers to preserve symmetry and/or positive definiteness of the original matrix and lead to convergent splittings.

### Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques

- Computer ScienceSIAM J. Sci. Comput.
- 1998

This work investigates the use of sparse approximate-inverse preconditioners for the iterative solution of unsymmetric linear systems of equations and proposes a number of enhancements which may improve their performance.