Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 294

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

Liu, Wai-Hung, Sherman, Andrew H. · 1976 · SIAM Journal on Numerical Analysis

Abstract

In this paper we examine the Cuthill–McKee algorithm for ordering the unknowns and equations in systems of linear equations, $A{\bf x} = {\bf b}$, where A is sparse, symmetric, and positive definite. This algorithm is designed to produce a permutation matrix P such that $PAP^T $ has a small bandwidth. If we wish to exploit zeros in the band of A which occur before the first nonzero in each row and column, it has been experimentally observed that reversing the ordering produced by the Cuthill–McKee algorithm is often very much better than the original ordering in terms of the amount of storage and work required to factor A. We prove that for band elimination methods, the two orderings are equivalent and that, surprisingly, the reverse ordering is always at least as good as the original one when envelope elimination techniques are used. We give a condition on the matrix A under which the reverse ordering is strictly better than the original one, and we include several numerical experiments and analyses of practical examples to illustrate our results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0713020

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 294

Metadata

Authors
Liu, W.-H., & Sherman, A. H.
Venue
SIAM Journal on Numerical Analysis
Published
1976-04
Volume
13
Issue
2
Pages
198-213
ISSN
  • 0036-1429 (ISSN-L)
  • 1095-7170
OpenAlex
W2046140068
Cited by
294
References
4
FWCI
7.51
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.