New parallel strategies for block updating the QR decomposition
Journal
Parallel Algorithms and Applications
Date Issued
January 1, 1995
Author(s)
DOI
10.1080/10637199508915487
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. ©