Session 6C
Sparse Matrix Reordering and Graph Theory III

3:15 Approximate Degrees in Sparsity-Preserving Orderings for Symmetric and Unsymmetric Matrices

Patrick R. Amestoy, ENSEEIHT-IRIT, France; Timothy A. Davis, University of Florida, Gainesville; and Iain S. Duff, Rutherford Appleton Laboratory, England and CERFACS, France

3:45 A Column Approximate Minimum Degree Ordering Algorithm

Timothy A. Davis, University of Florida, Gainesville; John R. Gilbert, Xerox Palo Alto Research Center; Esmond G. Ng, and Barry Peyton, Oak Ridge National Laboratory

4:15 Finding Good Column Orderings for Sparse QR Factorization

Pinar Heggernes, University of Bergen, Norway; and Pontus Matstoms, Linkoping University, Sweden

4:45 Graph Partitioning Based Sparse Matrix Ordering Algorithms for Finite-Element and Optimization Problems

Anshul Gupta, IBM T. J. Watson Research Center

Back to SM96 Program-at-a-Glance

Registration | Hotel Information | Transportation Information | Speaker Index