The DOI matches its Crossref record.
Reducing the bandwidth of sparse symmetric matrices
Abstract
The finite element displacement method of analyzing structures involves the solution of large systems of linear algebraic equations with sparse, structured, symmetric coefficient matrices. There is a direct correspondence between the structure of the coefficient matrix, called the stiffness matrix in this case, and the structure of the spatial network delineating the element layout. For the efficient solution of these systems of equations, it is desirable to have an automatic nodal numbering (or renumbering) scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth. This is the problem considered by R. Rosen1. A direct method of obtaining such a numbering scheme is presented. In addition several methods are reviewed and compared.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
A linear time implementation of the reverse Cuthill-McKee algorithm
Chan, W. M., & George, A. (1980) · BIT Numerical Mathematics · doi:10.1007/bf01933580 · Cited by 80
Connelly, E., del Genio, C. I., & Harrison, F. (2020) · mBio · doi:10.1128/mbio.03136-19 · Cited by 27
Metadata
- Authors
- Cuthill, E., & McKee, J.
- Venue
- Proceedings of the 1969 24th national conference on -
- Publisher
- ACM Press
- Published
- 1969
- Pages
- 157-172
- OpenAlex
- W2095420020
- Cited by
- 1,457
- References
- 0
- FWCI
- 2.64
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reducing the bandwidth of sparse symmetric matrices. https://app.cochat.ai/papers/10.1145/800195.805928
- The paper
- Cuthill, E., & McKee, J. (1969). Reducing the bandwidth of sparse symmetric matrices. Proceedings of the 1969 24th national conference on -. https://doi.org/10.1145/800195.805928
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.
