A column approximate minimum degree ordering algorithm

ACM Transactions on Mathematical Software

Volumn 30, Issue 3, 2004, Pages 353-376

  Davis, Timothy A ^a   Gilbert, John R ^b,e   Larimore, Stefan I ^c   Ng, Esmond G ^d  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT   (United States)

^d LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^e University of California   (United States)

Author keywords

Linear equations; Ordering methods; Sparse nonsymmetric matrices

Indexed keywords

COLUMN APPRIXIMATION; FACTORIZATION; MINIMUM DEGREE ORDERING ALGORITHM; PARTIAL PIVOTING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; OPTIMIZATION;

PATTERN RECOGNITION;

EID: 8344231475     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/1024074.1024079     Document Type: Article

References (46)

1. AMESTOY, P. E., DAVIS, T. A., AND DUFF. I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905.
2. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3 (Sept.), xxx-xx.
3. ASHCRAFT. C. C. 1995. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput. 16, 1404-1411.
4. BAI, Z., DAY, D., DEMMEL, J., AND DONGARBA, J. 1996. Test matrix collection (non-Hermitian eigenvalue problems), Release 1. Tech. rep., University of Kentucky. September. Available at ftp://ftp.ms.uky.edu/pub/misc/ bai/Collection.
5. BERGER, A. J., MULVEY, J. M., ROTHBERG, E., AND VANDERBEI, R. J. 1995. Solving multistage stochastic programs using tree dissection. Tech. Rep. SOR-95-07, Dept. of Civil Eng. and Operations Research, Princeton Univ., Princeton, NJ. June.
6. CAROLAN, W. J., HILL, J. E., KENNINGTON, J. L., NIEMI, S., AND WICHMANN, S. J. 1990. An empirical evaluation of the korbx algorithms for military airlift applications. Operations Research 38, 2, 240-248.
7. COLEMAN, T. F., EDENBRANDT, A., AND GILBERT, J. R. 1986. Predicting fill for sparse orthogonal factorization. J. ACM 33, 517-582.
8. DAVIS, T. A. 2000. Univ. of Florida sparse matrix collection, http://www.cise.ufl.edu/research/ sparse.
9. DAVIS, T. A. AND DUFF, I. S. 1997. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Anal. Appl. 18, 1, 140-158.
10. DAVIS, T. A. AND DUFF, I. S. 1999. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Softw. 25, 1, 1-19.
11. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND No, E. G. 2004. Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3 (Sept.), xxx-xxx
12. DEMMEL, J. W., EISENSTAT, S. C., GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755.
13. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level-3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17.
14. DONGARRA, J. J. AND GROSSE, E. 1987. Distribution of mathematical software via electronic mail. Commun. ACM 30, 403-407.
15. DUFF, I. S. 1981. On algorithms for obtaining a maximum transversal. ACM Trans. Math. Softw. 7, 315-330.
16. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1-14.
17. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1992. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1). Tech. Rep. RAL-92-086, Rutherford Appleton Laboratory, Didcot, Oxon, England. Dec.
18. DUFF, I. S. AND REID, J. K. 1983. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9, 3, 302-325.
19. FELDMANN, P., MELVILLE, R., AND LONG, D. 1996. Efficient frequency domain analysis of large nonlinear analog circuits. In Proceedings of the IEEE Custom Integrated Circuits Conference (Santa Clara, Calif.). IEEE Computer Society Press, Los Alamitos Calif.
20. GEORGE, A. AND LIU, J. W. H. 1980. An optimal algorithm for symbolic factorization of symmetric matrices. SIAM J. Comput. 9, 583-593.
21. GEORGE, A. AND LIU, J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, N.J.
22. GEORGE, A. AND MCINTYRE, D. R. 1978. On the application of the minimum degree algorithm to finite element systems. SIAM J. Numer. Anal. 15, 90-111.
23. GEORGE, A. AND NG, E. 1985. An implementation of Gaussian elimination with partial pivoting for sparse systems. SIAM J. Sci. Statist. Comput. 6, 2, 390-409.
24. GEORGE, A. AND NG, E. 1987. Symbolic factorization for sparse Gaussian elimination with partial pivoting. SIAM J. Sci. Statist. Comput. 8, 6, 877-898.
25. GILBERT, J. R., MOLER, C., AND SCHREIBER, R. 1992. Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Applic. 13, 1, 333-356.
26. GILBERT, J. R. AND No, E. G. 1993. Predicting structure in nonsymmetric sparse matrix factorizations, In Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, Eds. Volume 56 of the IMA Volumes in Mathematics and Its Applications. Springer-Verlag, New York, 107-139.
27. GILBERT, J. R., NG, E. G., AND PEYTON, B. W. 1994. An efficient algorithm to compute row and column counts for sparse Cholesky factorization. SIAM J. Matrix Anal. Applic. 15, 4, 1075-1091.
28. GELBERT, J. R. AND PETERLS, T. 1988. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Statist. Comput. 9, 862-874.
29. GUSTAVSON, F. G. 1978. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Trans. Math. Softw. 4, 3, 250-269.
30. HARE. D. E., JOHNSON, C. R., OLESKY, D. D., AND VAN DEN DRIESSCHE, P. 1993. Sparsity analysis of the QR factorization. SIAM J. Matrix Anal. Appl. 14, 3, 665-669.
31. HEGGERNES, P. AND MATSTOMS, P. 1994. Finding good column orderings for sparse QR factorization. Tech. rep., Dept. of Informatics, Univ. of Bergen, Bergen, Norway.
32. KARMARKAR, N. 1978. A new polynomial time algorithm for linear programming. Combinatorica 4, 373-395.
33. KEEN, J. L. 1999. Approximate deficiency for ordering the columns of a matrix. Tech. rep., Univ. of Florida, Gainesville, Fla. (Senior thesis, see http://www.cise.nfl.edu/colamd/kern.ps.)
34. LARIMORE, S. I. 1998. An approximate minimum degree column ordering algorithm. Tech. Rep. TR-98-016, Univ. of Florida, Gainesville, Fla. (Master's thesis, see http://www.cise.ufl.edu/techreports/.)
35. LIU, J. W. H. 1985, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Softw. 11, 2, 141-153.
36. LIU, J. W. H. 1991. A generalized envelope method for sparse factorization by rows. ACM Trans. Math. Softw. 17, 1, 112-129.
37. MARKOWITZ, H. M. 1957. The elimination form of the inverse and its application to linear programming. Manage. Sci. 3, 255-269.
38. MILLER, J. J. H. AND WANG, S. 1991. An exponentially fitted finite element method for a stationary convection-diffusion problem. In Computatioal Methods for Boundary and Interior Layers in Several Dimensions, J. J. H. Miller, Ed. Boole Press, Dublin, 120-137.
39. NG, E. G. AND RAGHAVAN, P. 1999. Performance of greedy ordering heuristics for sparse Cholesky factorization. SIAM J. Matrix Anal. Applic. 20, 4, 902-914.
40. RESENDE, M. G. C., RAMAKRISHNAN, K. G., AND DREZNER, Z. 1995. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper, Res. 43, 781-791.
41. ROTHBERG, E. AND EISENSTAT, S. C. 1998. Node selection strategies for bottom-up sparse matrix orderings. SIAM J. Matrix Anal. Applic. 19, 3, 682-695.
42. SHERMAN, A. H. 1975. On the efficient solution of sparse systems of linear and nonlinear equations. Tech. Rep. 46, Yale Univ. Dept. of Computer Science. Dec.
43. WRIGHT, S. J. 1996. Primal-dual interior-point methods. SIAM Publications, Philadelphia, Pa.
44. YANNAKAKIS, M. 1981. Computing the minimum fill-in is NP-camplete. SLAM J. Alg. Disc. Meth. 2, 77-79.
45. ZITNEY, S. E. 1992. Sparse matrix methods for chemical process separation calculations on supercomputers. In Proceedings of Supercomputing '92 (Minneapolis, Minn.) IEEE Computer Society Press, Los Alamitos, Calif, 414-423.
46. ZITNEY,S. E., MALLYA, J., DAVIS, T A., AND STADTHERR, M. A, 1996. Multifrontal vs. frontal techniques for chemical process simulation on supercomputers. Comput. Chem. Eng. 20, 6/7, 641-646.