A multilevel Crout ILU preconditioner with pivoting and row permutation

Numerical Linear Algebra with Applications

Volumn 14, Issue 10, 2007, Pages 771-789

  Mayer, Jan ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

ILUC; ILUCP; Incomplete lu factorization; Iterative methods; Preconditioning; Sparse linear systems

Indexed keywords

EID: 37049033645     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.554     Document Type: Article

References (27)

1. Chow E, Li N, Saad Y. Crout versions of ILU for sparse matrices. SIAM Journal on Scientific Computing 2003; 25(2):715-728.
2. Chow E, Saad Y. ILUS: an incomplete LU preconditioner in sparse skyline format. International Journal for Numerical Methods in Fluids 2003; 25:739-748.
3. Mayer J. ILUCP: a Crout ILU preconditioner with pivoting. Numerical Linear Algebra with Applications 2005; 12(9):941-955.
4. Saad Y. ILUT: a dual threshold incomplete LU factorization. Numerical Linear Algebra with Applications 1994; 1:387-402.
5. Saad Y. Iterative Methods for Sparse Linear Systems. SIAM: Philadelphia, PA, 2003.
6. Bollhöfer M. A robust ILU with pivoting based on monitoring the growth of inverse factors. Linear Algebra and its Applications 2001; 338:201-218.
7. Bollhöfer M. A robust and efficient ILU that incorporates the growth of the inverse triangular factors. SIAM Journal on Scientific Computing 2003; 25(1):86-103.
8. Bollhöfer M, Saad Y. Multilevel preconditioners constructed from inverse-based ILUs. SIAM Journal on Scientific Computing 2006; 27(5):1627-1650.
9. Mayer J. Alternative weighted dropping strategies for ILUTP. SIAM Journal on Scientific Computing 2006; 27(4): 1424-1437.
10. Benzi M, Haws JC, Tůma M. Preconditioning highly indefinite and nonsymmetric matrices. SIAM Journal on Scientific Computing 2000; 22(4):1333-1353.
11. Olschowka M, Neumaier A. A new pivoting strategy for Gaussian elimination. Linear Algebra and its Applications 1996; 220:131-151.
12. Duff IS, Koster J. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM Journal on Matrix Analysis and Applications 1999; 20(1):889-901.
13. Duff IS, Koster J. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM Journal on Matrix Analysis and Applications 2001; 22(4):973-996.
14. Saad Y. Multilevel ILU with reorderings for diagonal dominance. SIAM Journal on Scientific Computing 2006; 27:1032-1057.
15. Kayrpis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 1998; 20(1):359-392.
16. Saad Y, Suchomel B. ARMS: an algebraic recursive multilevel solver for general sparse linear systems. Numerical Linear Algebra with Applications 2002; 9(5):359-378.
17. Davis T. University of Florida Sparse Matrix Collection. http://www.cise.ufl.edu/research/sparse/matrices, ftp://ftp.cise.ufl.edu/pub/ faculty/davis/matrices, May 2007.
18. Bollhöfer M. ILUPACK. http://www.math.tu-berlin.de/ilupack/, May 2007.
19. Schenk O, Gärtner K. PARDISO. http://www.computational.unibas.ch/cs/ scicomp/software/pardiso/, May 2007.
20. Li N, Saad Y, Suchomel B. ITSOL. http://www-users.cs.umn.edu/∼saad/ software/ITSOL/, May 2007.
21. Mayer J. ILU + +. http://iamlasun8.mathematik.uni-karlsruhe.de/∼ae04/ iluplusplus.html, May 2007.
22. Schenk O, Gärtner K. On fast factorization pivoting methods for sparse symmetric indefinite systems. Electronic Transactions on Numerical Analysis 2006; 23:158-179.
23. Schenk O, Gärtner K. Solving unsymmetric sparse systems of linear equations with PARDISO. Journal of Future Generation Computer Systems 2004; 20(3):475-487.
24. Schenk O, Gärtner K, Fichtner W. Efficient sparse LU factorization with left-looking strategy on shared memory multiprocessors. BIT 2000; 40(1):158-176.
25. Kayrpis G. METIS. http://glaros.dtc.umn.edu/gkhome/views/metis/, May 2007.
26. Dolan ED, Moré JJ. Benchmarking optimization software with performance profiles. Mathematical Programming 2002; 91(2):201- 213.
27. Gould NIM, Scott JA, Hu Y. A numerical evaluation of sparse solvers for symmetric systems. ACM Transactions on Mathematical Software 2007; 33(2):10.