Please use this identifier to cite or link to this item:
Title: Pipeline givens sequences for computing the qr decomposition on a erew pram
Authors: Hofmann, Marc 
Kontoghiorghes, Erricos John 
Keywords: Parallel algorithms;Algebra;Random access memory
Issue Date: 2006
Publisher: Elsevier
Source: Parallel Computing, 2006, Volume 32, Issue 3, Pages 222-230
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 n 2/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.
ISSN: 01678191
Rights: © 2006 Elsevier B.V. All rights reserved.
Type: Article
Appears in Collections:Άρθρα/Articles

Show full item record

Citations 50

checked on Feb 8, 2018

Page view(s) 50

Last Week
Last month
checked on Aug 20, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.