The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Parallel Algorithms for Dense Linear Algebra Computations
Abstract
Scientific and engineering research is becoming increasingly dependent upon the development and implementation of efficient parallel algorithms on modern high-performance computers. Numerical linear algebra is an indispensable tool in such research and this paper attempts to collect and describe a selection of some of its more important parallel algorithms. The purpose is to review the current status and to provide an overall perspective of parallel algorithms for solving dense, banded, or block-structured problems arising in the major areas of direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers. A major emphasis is given here to certain computational primitives whose efficient execution on parallel and vector computers is essential in order to obtain high performance algorithms.
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
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
The WY representation for products of householder matrices
Bischof, C., & Van Loan, C. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908009 · Cited by 295
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
A class of parallel tiled linear algebra algorithms for multicore architectures
Buttari, A., Langou, J., Kurzak, J., & Dongarra, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.10.002 · Cited by 529
A comparative study of sparse approximate inverse preconditioners
Benzi, M., & Tûma, M. (1999) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(98)00118-4 · Cited by 280
Metadata
- Authors
- Gallivan, K. A., Plemmons, R. J., & Sameh, A. H.
- Venue
- SIAM Review
- Published
- 1990-03
- Volume
- 32
- Issue
- 1
- Pages
- 54-135
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2080038255
- Cited by
- 186
- References
- 3
- FWCI
- 22.44
- 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: Parallel Algorithms for Dense Linear Algebra Computations. https://app.cochat.ai/papers/10.1137/1032002
- The paper
- Gallivan, K. A., Plemmons, R. J., & Sameh, A. H. (1990). Parallel Algorithms for Dense Linear Algebra Computations. SIAM Review. https://doi.org/10.1137/1032002
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.