A Jacobi-like Algorithm for Computing the QR-Decomposition

Abstract

A parallel Jacobi-like method for computing the QR-decomposition of an $n \times n$ matrix is proposed. It requires $O(n^{2})$ processors and $O(n)$ units of time. The method can be extended to handle an $m \times n$ matrix $(m \geq n)$. The requirements become $O(n^{2})$ processors and $O(m)$ time.