Parallel Algorithms for Matrix Computations
SIAM, Jan 1, 1990 - Mathematics - 197 pages
Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
ACM Trans Alliant FX/8 analysis Appl architectures array BLAS2 BLAS3 block blocksizes cache Cholesky factorization cluster Comm Comp Computer Science Conf CRAY decomposition dense Department of Computer distributed memory distributed-memory DongARRA efficient eigenvalue problem elimination tree elliptic factorization algorithm finite element Gaussian elimination graph Heath HockNEY hypercube IEEE Trans ILLIAC IV implementation iterative Kuck linear algebra linear equations linear systems LU factorization Math Mathematics memory multiprocessors memory systems MIMD multifrontal Multigrid Methods multiprocessor National Laboratory nested dissection node number of processors numerical Oak Ridge operations ordering parallel algorithms Parallel Computing parallel processors parallel sparse partitioning performance pivoting primitives Proc processing programming reduction Report SAMEH scheme shared memory SIAM simulation singular value decomposition Software solvers sparse matrix Statist structure Supercomputing supernode symbolic factorization symmetric systolic systolic arrays tasks Tech tions triangular systems tridiagonal University of Illinois vector and parallel vector computers vector processors