The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The science of deriving dense linear algebra algorithms
Abstract
In this article we present a systematic approach to the derivation of families of high-performance algorithms for a large set of frequently encountered dense linear algebra operations. As part of the derivation a constructive proof of the correctness of the algorithm is generated. The article is structured so that it can be used as a tutorial for novices. However, the method has been shown to yield new high-performance algorithms for well-studied linear algebra operations and should also be of interest to those who wish to produce best-in-class high-performance codes.
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
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Cited by
Anatomy of high-performance matrix multiplication
Goto, K., & Geijn, R. A. V. D. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1356052.1356053 · Cited by 753
Self-citationBLIS: A Framework for Rapidly Instantiating BLAS Functionality
Van Zee, F. G., & van de Geijn, R. A. (2015) · ACM Transactions on Mathematical Software · doi:10.1145/2764454 · Cited by 356
Metadata
- Authors
- Bientinesi, P., Gunnels, J. A., Myers, M. E., Quintana-Ortí, E. S., & Geijn, R. A. V. D.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2005-03
- Volume
- 31
- Issue
- 1
- Pages
- 1-26
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1973305402
- Cited by
- 159
- References
- 1
- FWCI
- 11.30
- 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: The science of deriving dense linear algebra algorithms. https://app.cochat.ai/papers/10.1145/1055531.1055532
- The paper
- Bientinesi, P., Gunnels, J. A., Myers, M. E., Quintana-Ortí, E. S., & Geijn, R. A. V. D. (2005). The science of deriving dense linear algebra algorithms. ACM Transactions on Mathematical Software. https://doi.org/10.1145/1055531.1055532
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.