The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Communication-optimal Parallel and Sequential QR and LU Factorizations
Open accessAbstract
We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by “non-Strassen-like” QR, and using these in known communication lower bounds that are proportional to the number of multiplications. We not only show that our QR algorithms attain these lower bounds (up to polylogarithmic factors), but that existing LAPACK and ScaLAPACK algorithms perform asymptotically more communication. We derive analogous communication lower bounds for LU factorization and point out recent LU algorithms in the literature that attain at least some of these lower bounds. The sequential and parallel QR algorithms for tall and skinny matrices lead to significant speedups in practice over some of the existing algorithms, including LAPACK and ScaLAPACK, for example, up to 6.7 times over ScaLAPACK. A performance model for the parallel algorithm for general rectangular matrices predicts significant speedups over ScaLAPACK.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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
Self-citationThe Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Using MPI: Portable parallel programming with the message-passing interface
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90199-x · Cited by 2,854
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Sagan, H. (1994) · Universitext · doi:10.1007/978-1-4612-0871-6 · Cited by 1,336
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
Self-citationA 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
Self-citationI/O complexity: The red-blue pebble game
Hong, J., & Kung, H. T. (1981) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800076.802486 · Cited by 474
Solving linear least squares problems by Gram-Schmidt orthogonalization
Björck, Å. (1967) · BIT · doi:10.1007/bf01934122 · Cited by 470
Cited by
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
Dynamic Mode Decomposition and Its Variants
Schmid, P. J. (2022) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-030121-015835 · Cited by 640
Communication-Efficient Distributed Statistical Inference
Jordan, M. I., Lee, J. D., & Yang, Y. (2019) · Journal of the American Statistical Association · doi:10.1080/01621459.2018.1429274 · Cited by 442
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Minimizing Communication in Numerical Linear Algebra
Ballard, G., Demmel, J., Holtz, O., & Schwartz, O. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090769156 · Cited by 276
Self-citation
Metadata
- Authors
- Demmel, J., Grigori, L., Hoemmen, M., & Langou, J.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2012-01
- Volume
- 34
- Issue
- 1
- Pages
- A206-A239
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2157237396
- Cited by
- 407
- References
- 35
- FWCI
- 31.90
- Type
- journal article
- Language
- en
- Open access
- green
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: Communication-optimal Parallel and Sequential QR and LU Factorizations. https://app.cochat.ai/papers/10.1137/080731992
- The paper
- Demmel, J., Grigori, L., Hoemmen, M., & Langou, J. (2012). Communication-optimal Parallel and Sequential QR and LU Factorizations. SIAM Journal on Scientific Computing. https://doi.org/10.1137/080731992
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.