Please use this identifier to cite or link to this item:
|Title:||Stable parallel algorithms for computing and updating the qr decomposition||Authors:||Clarke, Michael R B
Kontoghiorghes, Erricos John
|Keywords:||Algorithms;Arithmetic;Parallel algorithms||Issue Date:||1993||Publisher:||IEEE Xplore Digital Library||Source:||10 Conference on Computer, Communication, Control aand Power Engineering,1993, Beijing, China||Abstract:||n this paper we propose new stable parallel algorithms based on Householder transformations and compound Given's rotations to compute the QR decomposition of a rectangular matrix. The predicted execution time of all algorithms on the massively parallel SIMD array processor AMT DAP-510, have been obtained and analyzed. Modified versions of these algorithms are also considered for updating the QR decomposition, when rows are inserted to the data matrix.||URI:||http://ktisis.cut.ac.cy/handle/10488/6804||ISBN:||0780312333||DOI:||10.1109/TENCON.1993.320102||Rights:||© IEEE - All rights reserved.||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
checked on Dec 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.