Crout versions of ilu factorization with pivoting for sparse symmetric matrices

Electronic Transactions on Numerical Analysis

Volumn 20, Issue , 2005, Pages 75-85

  Li, N A ^a   Saad, Yousef ^a  

^a University of Minnesota   (United States)

Author keywords

Bunch Kaufman pivoting; Crout factorization; Diagonal pivoting; ILU; ILU with threshold; ILUC; Incomplete LU factorization; Iterative methods; Preconditioning; Sparse Gaussian elimination; Sparse symmetric matrices

Indexed keywords

EID: 29344475227     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. C. AHSCRAFT, R. G. GRIMES, AND T. G. LEWIS, Accurate Symmetric Indefinite Linear Equation Solvers, SIAM J. Matrix Anal. Appl., 20 (1998), No. 2, pp. 513-561.
2. M. BOLLHÖFER AND Y. SAAD, A factored approximate inverse preconditioner with pivoting, SIAM J. Matrix Anal. Appl., 23 (2001), No. 3, pp. 692-705.
3. M. BOLLHÖFER, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Appl., 338 (2001), No. 1-3, pp. 201-218.
4. J. R. BUNCH AND B. N. PARLETT, Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations, SIAM J. Matrix Anal. Appl., 8 (1971), pp. 639-655.
5. J. R. BUNCH, Equilibration of Symmetric Matrices in the Max-Norm., 3. ACM, 18 (1971), No. 4, pp. 566-572.
6. J. R. BUNCH AND L. KAUFMAN, Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems, Math. Comp., 31 (1977), No. 137, pp. 163-179.
7. E. CUTHILL AND J. MCKEE, Reducing the bandwidth of sparse symmetric matrices, in Proceedings of the ACM National Conference, 24 (1969), pp. 157-172.
8. T. DAVIS, University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices, NA Digest, 92'(1994, October 16), No. 42,
9. NA Digest, 96 (1996, July 23), No. 28,
10. and NA Digest, 97 (1997, June 7), No. 23.
11. 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), No. 4, pp. 889-901.
12. I. S. DUFF AND S. PRALET, Strategies for scaling and pivoting for sparse symmetric indefinite problems, SIAM J. Matrix Anal. Appl., (to appear).
13. S. C. EISENSTAT, M. H. SCHULTZ, AND A. H. SHERMAN, Algorithms and data structures for sparse symmetric Gaussian elimination, SIAM J. Sci. Comput., 2 (1981), pp. 225-237.
14. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, Third ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
15. M. HAGEMANN AND O. SCHENK, Weighted Matchings for the Preconditioning of Symmetric Indefinite Linear Systems, Technical Report CS-2004-005, Department of Computer Science, University of Basel.
16. J. C. HAWS AND C. D. MEYER, Preconditioning KKT systems, Numer. Linear Algebra Appl., (to appear).
17. N. J. HIGHAM, Stability of the diagonal pivoting method with partial pivoting, SIAM J. Matrix Anal. Appl., 18 (2000), No. 1, pp. 52-65.
18. M. JONES AND P. PLASSMANN, An improved incomplete Cholesky factorization, ACM Trans. Math. Software, 21 (1995), pp. 5-17.
19. N. LI, Y. SA AD, AND E. CHOW, Crout versions of ILU for general sparse matrices, SIAM J. Sci. Comput., 25 (2003), No. 2, pp. 716-728.
20. L. LITTLE, KKT matrices far testing, Personal communication, 2003.
21. I. PERUGIA, V. SIMONCINI, AND M. ARIOLI, Linear Algebra Methods in a Mixed Approximation of Magnetostatic Problems, SIAM J. Sci. Comput., 21 (1999), No. 3, pp. 1085-1101.
22. Y. SAAD, SPARSKIT: A basic tool kit for sparse matrix computations, Technical Report RIACS-90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990.
23. Y. SAAD, ILUT: a dual threshold incomplete ILU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
24. Y. SAAD, Iterative Methods for Sparse Linear Systems, Second ed., SIAM, Philadelphia, 2003.