Parallel algorithms for QR decomposition on a shared memory multiprocessor

Authors:
K. Wright
Affiliations:
-
Venue:
Parallel Computing
Year:
1991

Citing 3
Cited 0

The WY representation for products of householder matrices

SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
The algebraic eigenvalue problem

The algebraic eigenvalue problem
Parallel Algorithms and Matrix Computation

Parallel Algorithms and Matrix Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Householder transformations are considered. A number of parallelisation techniques are used with particular emphasis on algorithms which allocate work to tasks dynamically. The results indicate that one version is significantly better than the others.