Please use this identifier to cite or link to this item:
Title: Parallel strategies for rank-k updating of the qr decomposition
Authors: Kontoghiorghes, Erricos John 
Major Field of Science: Social Sciences
Field Category: Economics and Business
Keywords: Parallel algorithms;Algorithms;Strategy
Issue Date: 2000
Source: SIAM Journal on Matrix Analysis and Applications, 2000, vol. 22, no. 3, pp. 714-725
Volume: 22
Issue: 3
Start page: 714
End page: 725
Journal: SIAM Journal on Matrix Analysis and Applications 
Abstract: arallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n × n matrix after a rank-k change (k < n). The complexity analyses of the Givens algorithms are based on the total number of Givens rotations applied to a 2-element vector. The algorithms, which are extensions of the rank-1 updating method, achieve the updating using approximately 2(k + n) compound disjoint Givens rotations (CDGRs) with elements annihilated by rotations in adjacent planes. Block generalization of the serial rank-1 algorithms are also presented. The algorithms are rich in level 3 BLAS operations, making them suitable for implementation on large scale parallel systems. The performance of some of the algorithms on a 2-D SIMD (single instruction stream-multiple instruction stream) array processor is discussed.
ISSN: 1095-7162
DOI: 10.1137/S0895479896308585
Rights: ©Society for Industrial and Applied Mathematics
Type: Article
Affiliation: Institut d'Informatique, Université de Neuchâtel, Switzerland 
Affiliation : University of London 
Appears in Collections:Άρθρα/Articles

CORE Recommender
Show full item record

Citations 20

checked on Aug 31, 2020

Page view(s) 20

Last Week
Last month
checked on Oct 28, 2020

Google ScholarTM



This item is licensed under a Creative Commons License Creative Commons