Cuthill–McKee algorithm
In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth. The reverse Cuthill–McKee algorithm (RCM) due to Alan George and Joseph Liu is the same algorithm but with the resulting index numbers reversed. In practice this generally results in less fill-in than the CM ordering when Gaussian elimination is applied.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Arrangement107938773
- Array107939382
- Event100029378
- Group100031264
- Matrix108267640
- Procedure101023820
- PsychologicalFeature100023100
- Rule105846932
- WikicatGraphAlgorithms
- WikicatMatrices
- WikicatSparseMatrices
- YagoPermanentlyLocatedEntity
- Comment
- enIn numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth. The reverse Cuthill–McKee algorithm (RCM) due to Alan George and Joseph Liu is the same algorithm but with the resulting index numbers reversed. In practice this generally results in less fill-in than the CM ordering when Gaussian elimination is applied.
- Depiction
- Has abstract
- enIn numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth. The reverse Cuthill–McKee algorithm (RCM) due to Alan George and Joseph Liu is the same algorithm but with the resulting index numbers reversed. In practice this generally results in less fill-in than the CM ordering when Gaussian elimination is applied. The Cuthill McKee algorithm is a variant of the standard breadth-first searchalgorithm used in graph algorithms. It starts with a peripheral node and thengenerates levels for until all nodesare exhausted. The set is created from set by listing all vertices adjacent to all nodes in . These nodes are ordered according to predecessors and degree.
- Is primary topic of
- Cuthill–McKee algorithm
- Label
- enCuthill–McKee algorithm
- Link from a Wikipage to an external page
- www.boost.org/doc/libs/1_37_0/libs/graph/doc/cuthill_mckee_ordering.html
- ciprian-zavoianu.blogspot.com/2009/01/project-bandwidth-reduction.html
- docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csgraph.reverse_cuthill_mckee.html
- www.mathworks.com/help/matlab/ref/symrcm.html
- Link from a Wikipage to another Wikipage
- Adjacency matrix
- Algorithm
- Band matrix
- Bandwidth (matrix theory)
- Boost C++ Libraries
- Breadth-first search
- Category:Graph algorithms
- Category:Matrix theory
- Category:Sparse matrices
- Cython
- Degree (graph theory)
- Elizabeth Cuthill
- File:Can 73 cm.svg
- File:Can 73 rcm.svg
- Graph (discrete mathematics)
- Graph bandwidth
- Level structure
- N-tuple
- Numerical linear algebra
- Peripheral vertex
- SciPy
- Sparse matrix
- Symmetric matrix
- Vertex (graph theory)
- SameAs
- Algoritmo Cuthill-McKee
- Algoritmo de Cuthill-McKee
- CHZY
- Cuthill-McKee-Algorithmus
- Cuthill–McKee-algoritmus
- m.03zv55
- Q1146458
- Алгоритм Катхилла — Макки
- Алгоритм Катхілл — Маккі
- الگوریتم کاتهیل مکی
- カットヒル・マキー法
- Subject
- Category:Graph algorithms
- Category:Matrix theory
- Category:Sparse matrices
- Thumbnail
- WasDerivedFrom
- Cuthill–McKee algorithm?oldid=1094198576&ns=0
- WikiPageLength
- 4258
- Wikipage page ID
- 1019406
- Wikipage revision ID
- 1094198576
