Cuthill–McKee algorithm: Difference between revisions

Revision as of 08:02, 9 February 2012

Revision as of 02:12, 1 May 2012

Line 6:

In the [[mathematics|mathematical]] subfield of [[matrix theory]], the '''Cuthill–McKee algorithm''' (named for Elizabeth Cuthill and J. McKee)

<ref name="cm"> E. Cuthill and J. McKee. [http://portal.acm.org/citation.cfm?id=805928''Reducing the bandwidth of sparse symmetric matrices''] In Proc. 24th Nat. Conf. [[Association for Computing Machinery|ACM]], pages 157–172, 1969.</ref> is an [[algorithm]] to permute a [[sparse matrix]] that has a [[symmetric matrix|symmetric]] sparsity pattern into a [[band matrix]] form with a small [[bandwidth (matrix theory)|bandwidth]]. The '''reverse Cuthill–McKee algorithm''' ('''RCM''') due to Alan George is the same algorithm but with the resulting index numbers reversed. In practice this generally results in less [[Sparse_matrix#Reducing_fill-in|fill-in]] than the CM ordering when Gaussian elimination is applied.<ref name="gl"> J. A. George and J. W-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, 1981 </ref>

The Cuthill McKee algorithm is a variant of the standard [[breadth-first search]]