Minimizing the profile of a symmetric matrix

SIAM Journal on Scientific Computing

Volumn 23, Issue 5, 2002, Pages 1799-1816

  Hager, William W ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Cuthill McKee algorithm; Exchange method; Matrix envelope; Matrix ordering; Matrix profile; Sparse matrices; Spectral ordering; Wave front ordering; Weighted greed

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS;

SYMMETRIC MATRIX;

MATRIX ALGEBRA;

EID: 0036985979     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827500379215     Document Type: Article

References (27)

1. S. T. BARNARD, A. POTHEN, AND H. SIMON, A spectral algorithm for envelope reduction of sparse matrices, Numer. Linear Algebra Appl., 2 (1995), pp. 317-334.
2. E. G. BOMAN AND B. HENDRICKSON, A Multilevel Algorithm for Reducing the Envelope of Sparse Matrices, Tech. Report SCCM-96-14, Stanford University, Stanford, CA, 1996.
3. E. CUTHILL AND J. McKEE, Reducing the bandwidth of sparse symmetric matrices, in Proceedings of the ACM National Conference, ACM, New York, 1969, pp. 157-172.
4. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
5. I. S. DUFF, J. K. REID, AND J. A. SCOTT, The use of profile reduction algorithms with a frontal code, Internat. J. Numer. Methods Engrg., 28 (1989), pp. 2555-2568.
6. C. M. FIDUCCIA AND R. M. MATTHEYSES, A linear time heuristic for improving network partitions, in Proceedings of the 19th IEEE Design Automation Conference, Las Vegas, NV, 1982, IEEE, Piscataway, NJ, 1982, pp. 175-181.
7. A. GEORGE AND J. W. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
8. A. GEORGE AND A. POTHEN, An analysis of spectral envelope reduction via quadratic assignment problems, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 706-732.
9. N. E. GIBBS, W. G. POOLE, AND P. K. STOCKMEYER, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM J. Numer. Anal., 13 (1976), pp. 236-250.
10. W. W. HAGER, Iterative methods for nearly singular linear systems, SIAM J. Sci. Comput., 22 (2000), pp. 747-766.
11. W. W. HAGER, The LP dual active algorithm, in High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone, A. Murli, P. M. Pardalos, and G. Toraldo, eds., Kluwer, Dordrecht, 1998, pp. 243-254.
12. W. W. HAGER, C.-L. SHIH, AND E. O. LUNDIN, Active Set Strategies and the LP Dual Active Set Algorithm, Department of Mathematics, University of Florida, Gainesville, FL, 1996; available from www.math.ufl.edu/̃hager.
13. B. HENDRICKSON AND R. LELAND, A Multilevel Algorithm for Partitioning Graphs, Tech. Report SAND93-1301, Sandia National Laboratories, Albuquerque, NM, 1993.
14. B. HENDRICKSON AND R. LELAND, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), pp. 452-469.
15. B. HENDRICKSON AND E. ROTHBERG, Improving the run time and quality of nested dissection ordering, SIAM J. Sci. Comput., 20 (1998), pp. 468-489.
16. HSL, A Collection of Fortran Codes for Large Scale Scientific Computation, 2000; available online from http://www.cse.clrc.ac.uk/Activity/HSL.
17. Y. F. HU AND J. A. SCOTT, Multilevel Algorithms for Wavefront Reduction, RAL-TR-2000-031, Rutherford Appleton Laboratory, Chilton, England, 2000; available online from www.numerical.rl.ac.uk/reports/reports.html.
18. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392.
19. G. KARYPIS AND V. KUMAR, Multilevel k-way partitioning scheme for irregular graphs, J. Parallel Distrib. Comput., 48 (1998), pp. 96-129.
20. G. KARYPIS AND V. KUMAR, Parallel multilevel k-way partitioning scheme for irregular graphs, SIAM Rev., 41 (1999), pp. 278-300.
21. B. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 29 (1970), pp. 291-307.
22. G. KUMFERT AND A. POTHEN, Two improved algorithms for reducing the envelope and wavefront, BIT, 37 (1997), pp. 1-32.
23. J. G. LEWIS, Implementations of the Gibbs-Poole-Stockmeyer and Gibbs-King algorithms, ACM Trans. Math. Software, 8 (1982), pp. 180-189.
24. W.-H. LIU AND A. H. SHERMAN, Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices, SIAM J. Numer. Anal., 13 (1976), pp. 198-213.
25. J. K. REID AND J. A. SCOTT, Implementing Hager's exchange methods for matrix profile reduction, RAL-TR-2001-039, Rutherford Appleton Laboratory, Chilton, England, 2001.
26. J. K. REID AND J. A. SCOTT, Ordering symmetric sparse matrices for small profile and wave-front, Internat. J. Numer. Methods Engrg., 45 (1999), pp. 1737-1755.
27. S. W. SLOAN, An algorithm for profile and wavefront reduction of sparse matrices, Internat. J. Numer. Methods Engrg., 23 (1986), pp. 239-251.