Reverse Cuthill-McKee

The file rcm.c contains an inplementation of the reverse Cuthill-McKee algorithm in ANSI C. For easy use we have a header file rcm.h.
An example how to make the C version usable from Fortran is shown in rcm_f77.c.

Download

rcm.tgz		rcm.c, rcm.h, rcm_f77.c - all in one archive
rcm.c	doc	ANSI C source code
rcm.h	doc	Header file for rcm.c
rcm_f77.c	doc	Wrapper functions for use from Fortran

Contact

Contact me under david.fritzsche AT temple.edu if you have any problems or questions about the RCM code.

References

E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 1969 24th national conference, pages 157-172, New York, NY, USA, 1969. ACM Press.

Alan George and Joseph W. H. Liu. Computer solution of large sparse positive definite systems. Prentice-Hall series in computational mathematics. Prentice-Hall, Englewood Cliffs, NJ, USA, 1981.

N. E. Gibbs, W. G. Poole, and P. K. Stockemeyer. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal of Numerical Analysis, 13(2):236-250, April 1976.

Alan George and Joseph W. H. Liu. An implementation of a pseudoperipheral node finder. ACM Trans. Math. Softw., 5(3):284-295, 1979.

Wai-Hung Liu and Andrew H. Sherman. Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices. SIAM Journal on Numerical Analysis, 13(2):198-213, April 1976.

BibTeX File

Last modified: Thu Sep 15 00:30:38 EDT 2005