Please use this identifier to cite or link to this item:
|Title:||Recursive least-squares using a hybrid householder algorithm on massively parallel simd systems||Authors:||Clint, Maurice
Naegeli, H. H.
Kontoghiorghes, Erricos John
|Issue Date:||1999||Publisher:||Elsevier||Source:||Parallel Computing, 1999, Volume 25, Issue 9, Pages 1147-1159||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.||URI:||http://ktisis.cut.ac.cy/handle/10488/6800||ISSN:||01678191||DOI:||10.1016/S0167-8191(99)00043-5||Rights:||© 1999 Elsevier Science B.V. All rights reserved.|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
checked on May 20, 2017
WEB OF SCIENCETM
checked on May 7, 2017
checked on Jun 22, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.