Generic graph algorithms for sparse matrix ordering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1732, Issue , 1999, Pages 120-129

  Lee, Lie Quan ^a   Siek, Jeremy G ^a   Lumsdaine, Andrew ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; GRAPH THEORY; OBJECT ORIENTED PROGRAMMING;

COMPONENT LIBRARIES; EXPERIMENTAL COMPARISON; GENERIC PROGRAMMING; LANGUAGE FEATURES; PROGRAMMING ABSTRACTIONS; PROGRAMMING PARADIGMS; SPARSE MATRIX ORDERING; THEORETICAL FRAMEWORK;

MATRIX ALGEBRA;

EID: 0005045537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704054_13     Document Type: Conference Paper

References (17)

1. M Yannanakis. Computing the minimum fill-in is NP-complete. SIAM Journal of Algebraic and Discrete Methods, 1981.
2. Kaixiang Zhong. A sparse matrix package using the standard template library. Master’s thesis, University of Notre Dame, 1996.
3. Gary Kumfert and Alex Pothen. An object-oriented collection of minimum degree algorithms. In Computing in Object-Oriented Parallel Environments, pages 95-106, 1998.
4. Matthew H. Austern. Generic Programming and the STL. Addison Wesley Long- man, Inc, October 1998.
5. Jeremy G. Siek and Andrew Lumsdaine. The matrix template library: A generic programming approach to high performance numerical linear algebra. In Denis Carmel, Rodney R. Oldhhoeft, and Marydell Tholburn, editors, Computing in Object-Oriented Parallel Environments, pages 59-70, 1998.
6. Lie-Quan Lee, Jeremy G. Siek, and Andrew Lumsdaine. The generic graph com- ponent library. In OOPSLA’99, 1999. Accepted.
7. Meng Lee and Alexander Stepanov. The standard template library. Technical report, HP Laboratories, February 1995.
8. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
9. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addiaon Wesley Publishing Company, October 1994.
10. Yannis Samaragdakis and Don Batory. Implementing layered designs with mixin layers. In The Europe Conference on Object-Oriented Programming, 1998.
11. Esmond G. Ng and Padma Raghavan. Performance of greedy ordering heuristics for sparse Cholesky factorization. SIAM Journal on Matrix Analysis and Applications, To appear.
12. S. Parter. The use of planar graph in Gaussian elimination. SIAM Review, 3:364-369, 1961.
13. Alan George and Joseph W. H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, March 1989.
14. Patrick Amestoy, Timothy A. Davis, and Iain S. Duff. An approximation minimum degree ordering algorithm. SIAM J. Matrix Analysis and Applications, 17(4):886-905, 1996.
15. Joseph W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Transaction on Mathematical Software, 11(2):141-153, 1985.
16. Roger G. Grimes, John G. Lewis, and Iain S. Duff. User’s guide for the harwell- boeing sparse matrix collection. User’s Manual Release 1, Boeing Computer Ser- vices, Seattle, WA, October 1992.
17. University of Florida sparse matrix collection. http://www-pub.cise.ufl.edu/_davis/sparse/.