论文信息 - A linear time implementation of the reverse Cuthill-McKee algorithm

A linear time implementation of the reverse Cuthill-McKee algorithm

The Reverse Cuthill-McKee (RCM) algorithm is a method for reordering a sparse matrix so that it has a small envelope. Given a starting node, we provide an implementation of the algorithm whose run-time complexity is proved to be linear in the number of nonzeros in the matrix. Numerical experiments are provided which compare the performance of the new implementation to a good conventional implementation.

Alan George | W. M. Chan | A. George | W. Chan

[1] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[2] Joseph Wai-Hung Liu,et al. On reducing the profile of sparse symmetric matrices. , 1976 .

[3] Claude Berge,et al. The theory of graphs and its applications , 1962 .

[4] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[5] Alan George,et al. An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.

[6] A. George,et al. Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems , 1978 .