Answers are grounded in this paper and cite their sources.
Parallel strategies are proposed for updating the QR decomposition of an mxn 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.
No takes yet. Share an insight, caveat, or question.
Erricos John Kontoghiorghes (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: