Effective preconditioning through ordering interleaved with incomplete factorization

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 4, 2006, Pages 1069-1088

  Lee, Ingyu ^a   Raghavan, Padma ^a   Ng, Esmond G ^b  

^a The Center for Nanotechnology Education and Utilization   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Ordering; Preconditioned incomplete factorization

Indexed keywords

CHOLESKY FACTORIZATION; ORDERING; PRECONDITIONED INCOMPLETE FACTORIZATION;

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS;

MATRIX ALGEBRA;

EID: 33750170949     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/040618357     Document Type: Conference Paper

References (32)

1. P. R. AMESTOY, T. A. DAVIS, AND I. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. C. ASHCRAFT AND J. W. H. LIU, Robust ordering of sparse matrices using multisection, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 816-832.
3. O. AXELSSON AND N. MUNKSGAARD, Analysis of incomplete factorizations with fixed storage allocation, in Preconditioning Methods: Analysis and Applications, D. Evans, ed., Gordon and Breach, New York, 1983, pp. 219-241.
4. P. CONCUS, G. GOLUB, AND D. O'LEARY, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
5. E. F. D'AZEVEDO, P. A. FORSYTH, AND W.-P. TANG, Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 944-961.
6. E. D'AZEVEDO, P. FORSYTH, AND W. TANG, Towards a cost-effective ILU preconditioner with high level fill, BIT, 32 (1992), pp. 442-463.
7. E. D'AZEVEDO, P. FORSYTH, AND W. TANG, On the Availability of Minimum Discarded Fill Ordering Codes, Personal communication, 2004.
8. I. DUFF AND G. MEURANT, The effect of ordering on preconditioned conjugate gradients, BIT, 29 (1989), pp. 635-637.
9. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, UK, 1986.
10. J. LIU, E. CHU, A. GEORGE, AND E. No, SPARSEPAK: Waterloo Sparse Matrix Package User's Guide for SPARSEPAK, Tech. Report CS-84-36, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1984.
11. A. GEORGE AND J. W. H. LIU, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
12. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems,Prentice-Hall, Englewood Cliffs, NJ, 1981.
13. NUMERICAL ALGORITHMS GROUP, The NAG C Library Manual, Mark 7, Oxford, UK, 2002.
14. M. R. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems, J. Research Nat. Bur. Standards, 49 (1952), pp. 409-436.
15. M. T. JONES AND P. E. PLASSMANN, Blocksolve95 Users Manual: Scalable Library Software for the Parallel Solution of Sparse Linear Systems, Tech. Report ANL-95/48, Argonne National Laboratory, Argonne, IL, 1995.
16. C.-J. LIN AND J. J. MORE, Incomplete Cholesky factorizations with limited memory, SIAM J. Sci, Comput., 21 (1999), pp. 24-45.
17. R. J. LIPTON, D. J. ROSE, AND R. E. TARJAN, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
18. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
19. T. A. MANTEUPPEL, An incomplete factorization technique for positive definite linear systems, Math. Comput., 34 (1980), pp. 473-497.
20. H. M. MARKOWITZ, The elimination form of the inverse and its application to linear program- ming, Management Sci., 3 (1957), pp. 255-269.
21. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
22. N. MUNKSGAARD, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
23. E. No, B. PEYTON, AND P. RAGHAVAN, A blocked incomplete cholesky preconditioner for hierarchical-memory computers, in Iterative Methods in Scientific Computation IV, D. R. Kincaid and A. C. Elster, eds., IMACS Ser. Comput. Appl. Math. 5, International Associ- ation for Mathematics and Computers in Simulation, Rutgers University, New Brunswick, NJ, 1999, pp. 211-221.
24. E. G. NG AND P. RAGHAVAN, Performance of greedy ordering heuristics for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 902-914.
25. S. PARTER, The use of linear graphs in Gauss elimination, SIAM Rev., 3 (1961), pp. 119-130.
26. D. J. ROSE, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972, pp. 183-217.
27. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
28. E. ROTHBERG AND S. C. EISENSTAT, Node selection strategies for bottom-up sparse matrix ordering, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 682-695.
29. Y. SAAD, ILUT : A dual threshold incomplete factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
30. J. SCHULZE, Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods, BIT, 41 (2001), pp. 800-841.
31. W. F. TINNEY AND J. W. WALKER, Direct solutions of sparse network equations by optimally ordered triangular factorization, in Proc. IEEE, 55 (1967), pp. 1801-1809.
32. Z. ZLATEV, Use of iterative refinement in the solution of sparse linear systems, SIAM J. Numer. Anal., 19 (1982), pp. 381-399.