The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Abstract
SuiteSparseQR is a sparse QR factorization package based on the multifrontal method. Within each frontal matrix, LAPACK and the multithreaded BLAS enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel's Threading Building Blocks library. The symbolic analysis and ordering phase pre-eliminates singletons by permuting the input matrix A into the form [ R 11 R 12 ; 0 A 22 ] where R 11 is upper triangular with diagonal entries above a given tolerance. Next, the fill-reducing ordering, column elimination tree, and frontal matrix structures are found without requiring the formation of the pattern of A TA . Approximate rank-detection is performed within each frontal matrix using Heath's method. While Heath's method is not always exact, it has the advantage of not requiring column pivoting and thus does not interfere with the fill-reducing ordering. For sufficiently large problems, the resulting sparse QR factorization obtains a substantial fraction of the theoretical peak performance of a multicore computer.
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
Cites
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Self-citationNumerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
A set of level 3 basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Duff, I. S. (1990) · ACM Transactions on Mathematical Software · doi:10.1145/77626.79170 · Cited by 1,821
Direct Methods for Sparse Linear Systems
Davis, T. A. (2006) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718881 · Cited by 1,443
Self-citationUsing OpenMP: portable shared memory parallel programming
(2008) · Choice Reviews Online · doi:10.5860/choice.46-0930 · Cited by 1,139
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Metadata
- Authors
- Davis, T. A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2011-11
- Volume
- 38
- Issue
- 1
- Pages
- 1-22
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2053999255
- Cited by
- 271
- References
- 37
- FWCI
- 15.25
- 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: Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. https://app.cochat.ai/papers/10.1145/2049662.2049670
- The paper
- Davis, T. A. (2011). Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. ACM Transactions on Mathematical Software. https://doi.org/10.1145/2049662.2049670
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.