Greedy Givens algorithms for computing the rank-k updating of the QR decomposition

Parallel Computing

Volumn 28, Issue 9, 2002, Pages 1257-1273

  Kontoghiorghes, Erricos John ^a  

^a UNIVERSITY OF NEUCHÂTEL   (Switzerland)

Author keywords

Complexity; Givens rotations; Parallel model of computation; Parallel random access machine; QR decomposition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; RANDOM ACCESS STORAGE;

PARALLEL RANDOM ACCESS MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0036725486     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00132-1     Document Type: Article

References (13)

1. Load balanced parallel QR decomposition on shared memory multiprocessors
2. Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM
3. Parallel QR decomposition of a rectangular matrix
4. Methods for modifying matrix factorizations
5. Parallel strategies for computing the orthogonal factorizations used in the estimation of econometric models
6. Parallel algorithms for linear models: Numerical methods and estimation problems
7. Parallel Givens sequences for solving the general linear model on a EREW PRAM
8. Parallel strategies for rank-k updating of the QR decomposition
9. An alternative Givens ordering
10. Rank-k modification methods for recursive least squares problems
11. On stable parallel linear system solvers
12. Adaptive condition estimation for rank-one updates of QR factorizations