An approximate minimum degree ordering algorithm

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 4, 1996, Pages 886-905

  Amestoy, Patrick R ^a   Davis, Timothy A ^b   Duff, Iain S ^c,d  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^c RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^d Europ Ctr Res/Adv Train Sci C   (France)

Author keywords

Approximate minimum degree ordering algorithm; Graph algorithms; Ordering algorithms; Quotient graph; Sparse matrices

Indexed keywords

EID: 0030491606     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894278952     Document Type: Article

References (31)

1. P. R. AMESTOY, Factorization of Large Sparse Matrices Based on a Multifrontal Approach in a Multiprocessor Environment, INPT Ph.D. thesis TH/PA/91/2, CERFACS, Toulouse, Prance, 1991.
2. P. R. AMESTOY, M. DAYDÉ, AND I. S. DUFF, Use of level 3 BLAS in the solution of full and sparse linear equations, in High Performance Computing: Proc. of the International Symposium on High Performance Computing, Montpellier, France, 1989, North-Holland, Amsterdam, pp. 19-31.
3. C. ASHCRAFT, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16 (1995), pp. 1404-1411.
4. C. ASHCRAFT, S. C. EISENSTAT, AND R. F. LUCAS, personal communication.
5. A. BERGER, J. MULVEY, E. ROTHBERG, AND R. VANDERBEI, Solving Multistage Stochastic Programs Using Tree Dissection, Tech. report SOR-97-07, Program in Statistics and Operations Research, Princeton University, Princeton, NJ, 1995.
6. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
7. T. A. DAVIS AND I. S. DUFF, An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization, SIAM J. Matrix Anal. Appl., to appear.
8. _, Unsymmetric-Pattern Multifrontal Methods for Parallel Sparse LU Factorization, Tech. report TR-91-023, CISE Department, University of Florida, Gainesville, FL, 1991.
9. I. S. DUFF, On algorithms for obtaining a maximum transversal, ACM Trans. Math. Software, 7 (1981), pp. 315-330.
10. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford University Press, London, UK, 1986.
11. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
12. _, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release 1), Tech. report RAL-92-086, Rutherford Appleton Laboratory, Didcot, Oxon, UK, 1992.
13. I. S. DUFF AND J. K. REID, A comparison of sparsity ordering s for obtaining a pivotal sequence in Gaussian elimination, J. Inst. Math. Appl., 14 (1974), pp. 281-291.
14. _, MA27 - A Set of Fortran Subroutines for Solving Sparse Symmetric Sets of Linear Equations, Tech. report AERE R10533, HMSO, London, UK, 1982.
15. _, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
16. _, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Comput., 5 (1984), pp. 633-641.
17. S. C. EISENSTAT, M. C. GURSKY, M. H. SCHULTZ, AND A. H. SHERMAN, Yale sparse matrix package, I: The symmetric codes, Internat. J. Numer. Meth. Eng., 18 (1982), pp. 1145-1151.
18. 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.
19. A. GEORGE AND J. W. H. LJU, A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, 6 (1980), pp. 337-358.
20. _, A minimal storage implementation of the minimum degree algorithm, SIAM J. Numer. Anal., 17 (1980), pp. 282-299.
21. _, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
22. _, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
23. A. GEORGE AND D. R. MCINTYRE, On the application of the minimum degree algorithm to finite element systems, SIAM J. Numer. Anal., 15 (1978), pp. 90-111.
24. 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.
25. J. W. H. LIU, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
26. H. M. MARKOWITZ, The elimination form of the inverse and its application to linear programming, Management Sci., 3 (1957). pp. 255 -269.
27. D. J. ROSE, Symmetric Elimination on Sparse Positive Definite Systems and the Potential Flow Network Problem, Ph.D. thesis, Applied Mathematics Department, Harvard University, 1970.
28. _, 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, 1973, pp. 183-217.
29. B. SPEELPENNINO, The Generalized Element Method, Tech. report UIUCDCS-R-78-946, Department of Computer Science, University of Illinois, Urbana, IL, 1978.
30. 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.
31. M. YANNAKAKIS, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., 2 (1981), pp. 77-79.