Please use this identifier to cite or link to this item: https://ktisis.cut.ac.cy/handle/10488/6741
Title: Pipeline givens sequences for computing the qr decomposition on a erew pram
Authors: Hofmann, Marc 
Kontoghiorghes, Erricos John 
Major Field of Science: Natural Sciences
Field Category: Computer and Information Sciences
Keywords: Parallel algorithms;Algebra;Random access memory
Issue Date: Mar-2006
Source: Parallel Computing, 2006, vol. 32, no. 3, pp. 222-230
Volume: 32
Issue: 3
Start page: 222
End page: 230
Journal: Parallel Computing 
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: 0167-8191
DOI: 10.1016/j.parco.2005.11.001
Rights: © Elsevier
Attribution-NonCommercial-NoDerivs 3.0 United States
Type: Article
Affiliation : University of Cyprus 
Birkbeck University of London 
Appears in Collections:Άρθρα/Articles

CORE Recommender
Show full item record

SCOPUSTM   
Citations

11
checked on Nov 26, 2020

WEB OF SCIENCETM
Citations 50

6
Last Week
0
Last month
0
checked on Nov 27, 2020

Page view(s)

211
Last Week
1
Last month
2
checked on Dec 2, 2020

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons