Node selection strategies for bottom-up sparse matrix ordering

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 3, 1998, Pages 682-695

  Rothberg, Edward ^a,b   Eisenstat, Stanley C ^c  

^a ILOG Inc   (United States)

^b HEWLETT PACKARD ENTERPRISE   (United States)

^c Yale University   (United States)

Author keywords

Graph algorithms; Minimum deficiency; Minimum degree; Minimum local fill; Ordering algorithms; Sparse matrices

Indexed keywords

EID: 0032397942     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896302692     Document Type: Article

References (22)

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, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16 (1995), pp. 1404-1411.
3. P. BERMAN AND G. SCHNITGER, On the performance of the minimum degree algorithm for Gaussian elimination, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 83-88.
4. I. A. CAVERS, Using Deficiency Measure for Tiebreaking the Minimum Degree Algorithm, Tech. report 89-2, Department of Computer Science. University of British Columbia, Vancouver, B.C., January 1989.
5. A. C. DAMHAUG, Sparse Solution of Finite Element Equations, Ph.D. thesis, Department of Structural Engineering, Norwegian Institute of Technology, Trondheim, Norway, 1992.
6. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986.
7. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
8. I. S. DUFF AND J. K. REID, A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination, J. Inst. Math. Appl., 14 (1974), pp. 281-291.
9. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
10. A. GEORGE AND J. W. H. LIU. A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, 6 (1980), pp. 337-358.
11. A. GEORGE AND J. W. H. LIU, A minimal storage implementation of the minimum degree algorithm, SIAM J. Numer. Anal., 17 (1980), pp. 282-299.
12. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, New York, 1981.
13. A. GEORGE AND J. W. H. LIU, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
14. J. R. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
15. J. W. H. LIU, Modification of the minimum degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
16. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Interior point methods for linear programming: Computational state of the art, ORSA J. Comput., 6 (1994), pp. 1-14.
17. H. M. MARKOWITZ, The elimination form of the inverse and its application to linear programming, Management Sci., 3 (1957), pp. 255-269.
18. C. MESZAROS, The Inexact Minimum Local Fill-In Ordering Algorithm, Tech. report WP 95 7, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, 1995.
19. E. G. NG AND P. RAGHAVAN, Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization, manuscript, Department of Computer Science, University of Tennessee at Knoxville, 1997.
20. 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. Read, ed., Academic Press, New York, 1972, pp. 183-217.
21. E. ROTHBERG, Ordering Sparse Matrices using Approximate Minimum Local Fill, manuscript, Silicon Graphics, Inc., Mountain View, CA, May 1996.
22. W. F. TINNEY AND J. W. WALKER, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proc. IEEE, 55 (1967), pp. 1801-1809.