Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/14724
Title: | New parallel strategies for block updating the QR decomposition |
Authors: | Kontoghiorghes, Erricos John |
metadata.dc.contributor.other: | Κοντογιώργης, Ερρίκος |
Major Field of Science: | Social Sciences |
Field Category: | Economics and Business |
Keywords: | Banded matrices;Givens rotations;Parallel algorithms;QR decomposition |
Issue Date: | 1-Jan-1995 |
Source: | Parallel Algorithms and Applications, 1995, vol. 5, no. 3-4, pp. 229-239 |
Volume: | 5 |
Issue: | 3-4 |
Start page: | 229 |
End page: | 239 |
Journal: | Parallel Algorithms and Applications |
Abstract: | Parallel strategies are proposed for updating the QR decomposition of an m × n matrix after adding k rows (k ≫ n). These strategies are based on Givens rotations and are found to complete the updating in fewer steps by comparison to a recently published algorithm. An efficient adaptation of the first parallel strategy to compute the QR decomposition of structured banded matrices is also discussed in detail. © |
URI: | https://hdl.handle.net/20.500.14279/14724 |
ISSN: | 17445779 |
DOI: | 10.1080/10637199508915487 |
Rights: | ©Taylor & Francis |
Type: | Article |
Affiliation : | City, University of London |
Publication Type: | Peer Reviewed |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.