Multilevel ILU with reorderings for diagonal dominance

SIAM Journal on Scientific Computing

Volumn 27, Issue 3, 2006, Pages 1032-1057

  Saad, Yousef ^a  

^a University of Minnesota   (United States)

Author keywords

Complete pivoting; ILUT; Incomplete LU factorization; Krylov subspace methods; Multielimination; Multilevel ILU preconditioner

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA; NUMERICAL METHODS;

COMPLETE PIVOTING; ILUT; INCOMPLETE LU FACTORIZATION; KRYLOV SUBSPACE METHODS; MULTIELIMINATION; MULTILEVEL ILU PRECONDITIONER;

COMBINATORIAL MATHEMATICS;

EID: 33646546339     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/030602733     Document Type: Article

References (38)

1. R. E. BANK AND C. WAGNER, Multilevel ILU decomposition, Numer. Math., 82 (1999), pp. 543-576.
2. A. BASERMANN, U. JAEKEL, AND K. HACHIYA, Preconditioning parallel sparse iterative solvers for circuit simulation, in SIAM Conference on Applied Linear Algebra, July 2003, Williamsburg, VA, CP-2.
3. M. BENZI, J. C. HAWS, AND M. TÜMA, Preconditioning highly indefinite and nonsymmtric matrices, SIAM J. Sci. Comput., 22 (2000), pp. 1333-1353.
4. M. BENZI, R. KOUHIA, AND M. TÜMA, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, Comput. Methods Appl. Mech. Engrg., 190 (2001), pp. 6533-6554.
5. M. BENZI, C. D. MEYER, AND M. TŮMA, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996), pp. 1135-1149.
6. M. BENZI AND M. TÜMA, Orderings for factorized sparse approximate inverse preconditioners, SIAM J. Sci. Comput., 21 (2000), pp. 1851-1868.
7. M. BENZI AND M. TÜMA, A sparse approximate inverse preconditioner for nonsymmetric linear systems, SIAM J. Sci. Comput., 19 (1998), pp. 968-994.
8. M. BENZI AND M. TÜMA, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl., 10 (2003), pp. 385-400.
9. M. BOLLHÖFER, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Appl., 338 (2001), pp. 201-213.
10. M. BOLLHÖFER AND Y. SAAD, On the relations between ILUs and factored approximate inverses, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 219-237.
11. M. BOLLHÖFER AND Y. SAAD, Multilevel Preconditioners Constructed from Inverse-based ILUs, Technical Report umsi-2004-75, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2004.
12. M. BOLLHÖFER AND Y. SAAD, ILUPACK - Preconditioning Software Package, release v1.0, http://www.tu-berlin.de/ilupack/ (14 May 2004).
13. C. W. BOMHOF AND H. A. VAN DER VORST, A parallel linear system solver for circuit simulation problems, Numer. Linear Algebra Appl., 7 (2000), pp. 649-665.
14. E. F. F. BOTTA AND F. W. WUBS, Matrix renumbering ILU: An effective algebraic multilevel ILU preconditioner for sparse matrices, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1007-1026.
15. E. CHOW AND Y. SAAD, Approximate inverse preconditioned via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
16. T. DAVIS, University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse (1997).
17. T. A. DAVIS, A Parallel Algorithm for Sparse Unsymmetric LU Factorizations, Ph.D. thesis, University of Illinois at Urbana Champaign, Urbana, IL., 1989.
18. I. S. DUFF, A survey of sparse matrix research, in Proceedings of the IEEE 65, New York, 1977, pp. 500-535.
19. I. S. DUFF, Algorithm 575: Permutations for a zero-free diagonal, ACM Trans. Math. Software, 7 (1981), pp. 387-390.
20. I. S. DUFF, On algorithms for obtaining a maximal transversal, ACM Trans. Math. Software, 7 (1981), pp. 315-330.
21. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986.
22. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, User's Guide for the Harwell-Boeing Sparse Matrix Collection, Technical Report TR/PA/92/86, CERFACS, Toulouse, France, 1992.
23. I. S. DUFF AND J. KOSTER, The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 889-901.
24. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
25. J. A. GEORGE AND J. W.-H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
26. G. H. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
27. M. J. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
28. J. C. HAWS AND C. D. MEYER, Preconditioning KKT Systems, Technical Report M&CT-TECH-02-002, Boeing, Seattle, WA, 2002.
29. L. YU. KOLOTILINA AND A. Y. YEREMIN, On a family of two-level preconditionings of the incomplete block factorization type, Soviet J. Numer. Anal. Math. Modeling, 1 (1986), pp. 293-320.
30. R. LEUZE, Independent set orderings for parallel matrix factorizations by Gaussian elimination, Parallel Comput., 10 (1989), pp. 177-191.
31. N. LI, Y. SAAD, AND E. CHOW, Crout versions of ILU for general sparse matrices, SIAM J. Sci. Comput., 25 (2003), pp. 716-728.
32. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
33. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
34. Y. SAAD, ILUM: A multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Comput., 17 (1996), pp. 830-847.
35. Y. SAAD, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, PA, 2003.
36. Y. SAAD AND B. SUCHOMEL, ARMS: An algebraic recursive multilevel solver for general sparse linear systems, Numer. Linear Algebra Appl., 9 (2002), pp. 359-378.
37. Y. SAAD AND J. ZHANG, BILUTM: A domain-based multilevel block ILUT preconditioner for general sparse matrices, SIAM J. Matrix Anal. Appl., 21 (1999), pp. 279-299.
38. O. SCHENK, S. RÖLLIN, AND A. GUPTA, The effects of nonsymmetric matrix permutations and scalings in semiconductor device and circuit simulation, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 23 (2004), pp. 400-411.