Stable parallel algorithms for computing and updating the qr decomposition

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/2619

Title:	Stable parallel algorithms for computing and updating the qr decomposition
Authors:	Clarke, Michael R B Kontoghiorghes, Erricos John
metadata.dc.contributor.other:	Κοντογιώργης, Έρρικος Γιάννης
Major Field of Science:	Natural Sciences
Field Category:	Mathematics
Keywords:	Algorithms;Arithmetic;Parallel algorithms
Issue Date:	1993
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:	https://hdl.handle.net/20.500.14279/2619
ISBN:	0780312333
DOI:	10.1109/TENCON.1993.320102
Rights:	© IEEE - All rights reserved.
Type:	Conference Papers
Affiliation:	QMW Coll, London, United Kingdom
Affiliation :	Queen Mary and Westfield College
Appears in Collections:	Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation

CORE Recommender

527

Last Week
0

Last month
8

checked on Dec 3, 2024

Check