Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2092
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Clint, Maurice | - |
dc.contributor.author | Naegeli, H. H. | - |
dc.contributor.author | Kontoghiorghes, Erricos John | - |
dc.contributor.other | Κοντογιώργης, Έρρικος Γιάννης | - |
dc.date.accessioned | 2013-02-01T14:13:49Z | en |
dc.date.accessioned | 2013-05-16T08:21:54Z | - |
dc.date.accessioned | 2015-12-02T09:28:36Z | - |
dc.date.available | 2013-02-01T14:13:49Z | en |
dc.date.available | 2013-05-16T08:21:54Z | - |
dc.date.available | 2015-12-02T09:28:36Z | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | Parallel Computing, 1999, Volume 25, Issue 9, Pages 1147-1159 | en_US |
dc.identifier.issn | 1678191 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/2092 | - |
dc.description.abstract | Within the context of recursive least-squares, the implementation of a Householder algorithm for block updating the QR decomposition, on massively parallel SIMD systems, is considered. Initially, two implementations based on different mapping strategies for distributing the data matrices over the processing elements of the parallel computer are investigated. Timing models show that neither of these implementations is superior in all cases. In order to increase computational speed, a hybrid implementation uses performance models to partition the problem into two subproblems which are then solved using the first and second implementation, respectively. | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.rights | © 1999 Elsevier Science B.V. All rights reserved. | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computer simulation | en_US |
dc.subject | Recursive functions | en_US |
dc.subject | Least squares | en_US |
dc.title | Recursive least-squares using a hybrid householder algorithm on massively parallel simd systems | en_US |
dc.type | Article | en_US |
dc.affiliation | Institut d'Informatique, Université de Neuchâtel, Switzerland | en |
dc.collaboration | Université de Neuchâtel | en_US |
dc.subject.category | Mathematics | en_US |
dc.country | Switzerland | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0167-8191(99)00043-5 | en_US |
dc.dept.handle | 123456789/54 | en |
cut.common.academicyear | empty | en_US |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | article | - |
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 | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
6
checked on Feb 13, 2018
Page view(s)
484
Last Week
2
2
Last month
6
6
checked on Jun 1, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.