The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A survey of direct methods for sparse linear systems
Abstract
Wilkinson defined a sparse matrix as one with enough zeros that it pays to take advantage of them. 1 This informal yet practical definition captures the essence of the goal of direct methods for solving sparse matrix problems. They exploit the sparsity of a matrix to solve problems economically: much faster and using far less memory than if all the entries of a matrix were stored and took part in explicit computations. These methods form the backbone of a wide range of problems in computational science. A glimpse of the breadth of applications relying on sparse solvers can be seen in the origins of matrices in published matrix benchmark collections (Duff and Reid 1979 a , Duff, Grimes and Lewis 1989 a , Davis and Hu 2011). The goal of this survey article is to impart a working knowledge of the underlying theory and practice of sparse direct methods for solving linear systems and least-squares problems, and to provide an overview of the algorithms, data structures, and software available to solve these problems, so that the reader can both understand the methods and know how best to use them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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 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 · cited 4×
“X. S. Li (2005), ‘An overview of SuperLU: Algorithms, implementation, and user interface’, ACM Trans.”
BackgroundMethodInfluentialA 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 · cited 1×
“A linear implementation of the RCM method is possible by being careful in the sorting step (Chan and George 1980).”
Method
Cited by
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Metadata
- Authors
- Davis, T. A., Rajamanickam, S., & Sid-Lakhdar, W. M.
- Venue
- Acta Numerica
- Publisher
- Cambridge University Press (CUP)
- Published
- 2016-05-01
- Volume
- 25
- Pages
- 383-566
- ISSN
- 0962-4929 (ISSN-L)
- 1474-0508
- OpenAlex
- W2397636522
- Cited by
- 238
- References
- 3
- FWCI
- 17.27
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A survey of direct methods for sparse linear systems. https://app.cochat.ai/papers/10.1017/s0962492916000076
- The paper
- Davis, T. A., Rajamanickam, S., & Sid-Lakhdar, W. M. (2016). A survey of direct methods for sparse linear systems. Acta Numerica. https://doi.org/10.1017/s0962492916000076
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.