Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2012
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kontoghiorghes, Erricos John | - |
dc.date.accessioned | 2013-02-01T13:28:17Z | en |
dc.date.accessioned | 2013-05-16T08:22:26Z | - |
dc.date.accessioned | 2015-12-02T09:33:19Z | - |
dc.date.available | 2013-02-01T13:28:17Z | en |
dc.date.available | 2013-05-16T08:22:26Z | - |
dc.date.available | 2015-12-02T09:33:19Z | - |
dc.date.issued | 2002-09-09 | - |
dc.identifier.citation | Parallel Computing, 2002, vol. 28, no. 9, pp. 1257-1273 | en_US |
dc.identifier.issn | 1678191 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/2012 | - |
dc.description.abstract | A Greedy Givens algorithm for computing the rank-1 updating of the QR decomposition is proposed. An exclusive-read exclusive-write parallel random access machine computational model is assumed. The complexity of the algorithms is calculated in two different ways. In the unlimited parallelism case a single time unit is required to apply a compound disjoint Givens rotation of any size. In the limited parallelism case all the disjoint Givens rotations can be applied simultaneously, but one time unit is required to apply a rotation to a two-element vector. The proposed Greedy algorithm requires approximately 5/8 the number of steps performed by the conventional sequential Givens rank-1 algorithm under unlimited parallelism. A parallel implementation of the sequential Givens algorithm outperforms the Greedy one under limited parallelism. An adaptation of the Greedy algorithm to compute the rank-k updating of the QR decomposition has been developed. This algorithm outperforms a recently reported parallel method for small k, but its efficiency decreases as k increases | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Parallel Computing | en_US |
dc.rights | ©Elsevier | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Computational complexity | en_US |
dc.subject | Algorithms | en_US |
dc.title | Greedy givens algorithms for computing the rank-k updating of the qr decomposition | en_US |
dc.type | Article | en_US |
dc.collaboration | Université de Neuchâtel | en_US |
dc.subject.category | Computer and Information Sciences | en_US |
dc.journals | Subscription | en_US |
dc.country | Cyprus | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.publication | Peer Reviewed | en_US |
dc.identifier.doi | 10.1016/S0167-8191(02)00132-1 | en_US |
dc.dept.handle | 123456789/54 | en |
dc.relation.issue | 9 | en_US |
dc.relation.volume | 28 | en_US |
cut.common.academicyear | 2002-2003 | en_US |
dc.identifier.spage | 1257 | en_US |
dc.identifier.epage | 1273 | en_US |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.grantfulltext | none | - |
crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
crisitem.author.orcid | 0000-0001-9704-9510 | - |
crisitem.author.parentorg | Faculty of Management and Economics | - |
crisitem.journal.journalissn | 0167-8191 | - |
crisitem.journal.publisher | Elsevier | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
3
checked on Nov 9, 2023
WEB OF SCIENCETM
Citations
50
3
Last Week
0
0
Last month
0
0
checked on Oct 29, 2023
Page view(s) 10
509
Last Week
1
1
Last month
12
12
checked on Aug 30, 2024
Google ScholarTM
Check
Altmetric
This item is licensed under a Creative Commons License