The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A Survey of Parallel Algorithms in Numerical Linear Algebra
Open accessAbstract
The existence of parallel and pipeline computers has inspired a new approach to algorithmic analysis. Classical numerical methods are generally unable to exploit multiple processors and powerful vector-oriented hardware. Efficient parallel algorithms can be created by reformulating familiar algorithms or by discovering new ones, and the results are often surprising. A comprehensive survey of parallel techniques for problems in linear algebra is given. Specific topics include: relevant computer models and their consequences for programs, evaluation of arithmetic expressions, solution of general and special linear systems of equations, and computation of eigenvalues.
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Bramble, J. H., & Varga, R. S. (1963) · Mathematics of Computation · doi:10.2307/2003862 · Cited by 4,091
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
Parallel Processing with the Perfect Shuffle
Stone, H. S. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223205 · Cited by 1,245
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Very high-speed computing systems
Flynn, M. J. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5273 · Cited by 959
The Parallel Evaluation of General Arithmetic Expressions
Brent, R. P. (1974) · Journal of the ACM · doi:10.1145/321812.321815 · Cited by 814
On Direct Methods for Solving Poisson’s Equations
Buzbee, B. L., Golub, G. H., & Nielson, C. W. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707049 · Cited by 734
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
Hockney, R. W. (1965) · Journal of the ACM · doi:10.1145/321250.321259 · Cited by 683
Asynchronous Iterative Methods for Multiprocessors
Baudet, G. M. (1978) · Journal of the ACM · doi:10.1145/322063.322067 · Cited by 519
Least Squares Computations by Givens Transformations Without Square Roots
GENTLEMAN, W. M. (1973) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/12.3.329 · Cited by 479
Chazan, D., & Miranker, W. (1969) · Linear Algebra and its Applications · doi:10.1016/0024-3795(69)90028-7 · Cited by 460
Fast Parallel Matrix Inversion Algorithms
Csanky, L. (1976) · SIAM Journal on Computing · doi:10.1137/0205040 · Cited by 397
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 396
An Adaptation of the Fast Fourier Transform for Parallel Processing
Pease, M. C. (1968) · Journal of the ACM · doi:10.1145/321450.321457 · Cited by 381
A direct Method for the Discrete Solution of Separable Elliptic Equations
Swarztrauber, P. N. (1974) · SIAM Journal on Numerical Analysis · doi:10.1137/0711086 · Cited by 270
Inversion of Matrices by Biorthogonalization and Related Results
Hestenes, M. R. (1958) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0106005 · Cited by 243
On the number of multiplications necessary to compute certain functions
Winograd, S. (1970) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160230204 · Cited by 177
On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
Sameh, A. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0297131-6 · Cited by 163
A Survey of Some Theoretical Aspects of Multiprocessing
Baer, J.-L. (1973) · ACM Computing Surveys · doi:10.1145/356612.356615 · Cited by 139
A Generalized Cyclic Reduction Algorithm
Sweet, R. A. (1974) · SIAM Journal on Numerical Analysis · doi:10.1137/0711042 · Cited by 98
A Survey of Parallelism in Numerical Analysis
Miranker, W. L. (1971) · SIAM Review · doi:10.1137/1013094 · Cited by 95
A Comparison of Some Theoretical Models of Parallel Computation
Miller, R. E. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009149 · Cited by 90
Parallel Processing of Ordinary Programs
Kuck, D. J. (1976) · Advances in computers · doi:10.1016/s0065-2458(08)60521-5 · Cited by 71
Klyuev, V. V., & Kokovkin-Shcherbak, H. I. (1965) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(65)90065-0 · Cited by 27
On the time required for a sequence of matrix products
Muraoka, Y., & Kuck, D. J. (1973) · Communications of the ACM · doi:10.1145/361932.361938 · Cited by 19
Cited by
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
Metadata
- Authors
- Heller, D.
- Venue
- SIAM Review
- Published
- 1978-10
- Volume
- 20
- Issue
- 4
- Pages
- 740-777
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2156281098
- Cited by
- 337
- References
- 32
- FWCI
- 15.50
- 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
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.