Algorithm 837: AMD, an approximate minimum degree ordering algorithm

ACM Transactions on Mathematical Software

Volumn 30, Issue 3, 2004, Pages 381-388

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

^a UNIVERSITY OF FLORIDA   (United States)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^c IRIT   (France)

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

MATHEMATICAL SOFTWARE; MINIMUM DEGREE; ORDERING METHODS; SPARSE MATRICES;

ALGORITHMS; APPROXIMATION THEORY; INTERFACES (COMPUTER); ITERATIVE METHODS; LINEAR EQUATIONS; MATRIX ALGEBRA;

COMPUTER SOFTWARE;

EID: 2942699190     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/1024074.1024081     Document Type: Review

References (9)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Applic. 17, 4, 886-905.
2. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3 (Sept.), 000-000.
3. GEORGE, A. AND LIU, J. W. H. 1989. The evolution of the minimum degree ordering algorithm. SIAM Rev. 31, 1, 1-19.
4. HENDRICKSON, B. AND ROTHBERG, E. 1999. Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput. 20, 468-489.
5. HSL. 2002. HSL 2002: A collection of Fortran codes for large scale scientific computation. http://www.cse.clrc.ac.uk/nag/hsl.
6. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
7. PELLEGRINI, F., ROMAN, J., AND AMESTOY, P. 2000. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience 12, 68-84.
8. 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.
9. SCHULZ, J. 2001. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT 41, 4, 800-841.