The DOI matches its Crossref record.
Modification of the minimum-degree algorithm by multiple elimination
Open accessAbstract
The most widely used ordering scheme to reduce fills and operations in sparse matrix computation is the minimum-degree algorithm. The notion of multiple elimination is introduced here as a modification to the conventional scheme. The motivation is discussed using the k -by- k grid model problem. Experimental results indicate that the modified version retains the fill-reducing property of (and is often better than) the original ordering algorithm and yet requires less computer time. The reduction in ordering time is problem dependent, and for some problems the modified algorithm can run a few times faster than existing implementations of the minimum-degree algorithm. The use of external degree in the algorithm is also introduced.
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
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
Solving unsymmetric sparse systems of linear equations with PARDISO
Schenk, O., & Gärtner, K. (2004) · Future Generation Computer Systems · doi:10.1016/j.future.2003.07.011 · Cited by 1,467
An Approximate Minimum Degree Ordering Algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894278952 · Cited by 731
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Li, X. S., & Demmel, J. W. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779361 · Cited by 628
An overview of SuperLU: Algorithms, implementation, and user interface
Li, X. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089017 · Cited by 467
Metadata
- Authors
- Liu, J. W. H.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1985-06
- Volume
- 11
- Issue
- 2
- Pages
- 141-153
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2086648616
- Cited by
- 361
- References
- 0
- FWCI
- 8.89
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Modification of the minimum-degree algorithm by multiple elimination. https://app.cochat.ai/papers/10.1145/214392.214398
- The paper
- Liu, J. W. H. (1985). Modification of the minimum-degree algorithm by multiple elimination. ACM Transactions on Mathematical Software. https://doi.org/10.1145/214392.214398
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.