Parallel QR factorization by householder and modified Gram-Schmidt algorithms

In this paper, the parallel implementation of two algorithms for forming a QR factorization of a matrix is studied. We propose parallel algorithms for the modified Gram-Schmidt and the Householder algorithms on message passing systems in which the matrix is distributed by blocks or rows. The models that predict performance of the algorithms are validated by experimental results on several parallel machines.