Parallel Algorithms for Dense Linear Algebra Computations

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 s...

Full description

Saved in:
Bibliographic Details
Published in:SIAM review 1990-03, Vol.32 (1), p.54-135
Main Authors: Gallivan, K. A., Plemmons, R. J., Sameh, A. H.
Format: Article
Language:English
Subjects:
Algorithms
Architecture
Array processors
Computer memory
Computers
Decomposition
Distributed memory
Eigenvalues
Exact sciences and technology
Factorization
Iterative methods
Linear algebra
Mathematical vectors
Mathematics
Matrices
Multiprocessors
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Partial differential equations
R&D
Research & development
Sciences and techniques of general use
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0036-1445
1095-7200
DOI:10.1137/1032002