The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fast Parallel Matrix Inversion Algorithms
Abstract
The parallel arithmetic complexities of matrix inversion, solving systems of linear equations, computing determinants and computing the characteristic polynomial of a matrix are shown to have the same growth rate. Algorithms are given that compute these problems in $O(\log ^2 n)$ steps using a number of processors polynomial in n. (n is the order of the matrix of the problem.)
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
Computational Methods of Linear Algebra
H., A. S., Faddeev, D. K., & Faddeeva, V. N. (1964) · Mathematics of Computation · doi:10.2307/2003785 · Cited by 1,599
A Survey of Matrix Theory and Matrix Inequalities.
Bellman, R., Marcus, M., & Minc, H. (1965) · The American Mathematical Monthly · doi:10.2307/2315999 · Cited by 842
Cited by
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
A taxonomy of problems with fast parallel algorithms
Cook, S. A. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80041-3 · Cited by 641
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.383347 · Cited by 609
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Completeness Classes in Algebra
Valiant, L. G. (1979) · ACM eBooks · doi:10.1145/3749740.3749750 · Cited by 465
Communication-optimal Parallel and Sequential QR and LU Factorizations
Demmel, J., Grigori, L., Hoemmen, M., & Langou, J. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/080731992 · Cited by 407
Quantum advantage with shallow circuits
Bravyi, S., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · Combinatorica · doi:10.1007/bf02579206 · Cited by 388
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
Computing connected components on parallel computers
Hirschberg, D. S., Chandra, A. K., & Sarwate, D. V. (1979) · Communications of the ACM · doi:10.1145/359138.359141 · Cited by 266
Minimum energy requirements of information transfer and computing
Bremermann, H. J. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857726 · Cited by 63
Metadata
- Authors
- Csanky, L.
- Venue
- SIAM Journal on Computing
- Published
- 1976-12
- Volume
- 5
- Issue
- 4
- Pages
- 618-623
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2113097540
- Cited by
- 397
- References
- 2
- FWCI
- 6.98
- 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
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.