ePrints

Parallel Algorithms of QR Decomposition on a Shared Memory Multi-processor

Lookup NU author(s): Dr Kenneth Wright

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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.

Publication metadata

Author(s): Wright K

Publication type: Article

Publication status: Published

Journal: Parallel Computing

Year: 1991

Volume: 17

Issue: 6-7

Pages: 779-790

ISSN (print): 0167-8191

ISSN (electronic): 1872-7336

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/S0167-8191(05)80066-3

DOI: 10.1016/S0167-8191(05)80066-3

Altmetrics

Share