Efficiency and scalability of two parallel QR factorization algorithms
J. M. Malard, Christopher C. Paige · 2002
Both the Householder QR factorization algorithm and the modified Gram-Schmidt algorithm can be written in terms of matrix-matrix operations using the Compact WY representation. Parallelizations of the resulting algorithms are reviewed and analyzed. For this purpose a general framework for analyzing the scalability of parallel algorithms is presented.>