Hofmann, M. and Kontoghiorghes, Erricos J. (2006) Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM. Parallel Computing 32 (3), pp. 222-230. ISSN 0167-8191.
Abstract
Parallel Givens sequences for computing the QR decomposition of an m × n (m > n) matrix are considered. The Givens rotations operate on adjacent planes. A pipeline strategy for updating the pair of elements in the affected rows of the matrix is employed. This allows a Givens rotation to use rows that have been partially updated by previous rotations. Two new Givens schemes, based on this pipeline approach, and requiring respectively n2/2 and n processors, are developed. Within this context a performance analysis on an exclusive-read, exclusive-write (EREW) parallel random access machine (PRAM) computational model establishes that the proposed schemes are twice as efficient as existing Givens sequences.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Givens rotation, QR decomposition, parallel algorithms, PRAM |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 18 Aug 2011 09:23 |
| Last Modified: | 09 Aug 2023 12:30 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/4023 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
