A triangular processor array for computing a singular value decomposition (SVD) of an $m \times n (m \geq n)$ matrix is proposed. A Jacobi-type algorithm is used to first triangularize the given matrix and then diagonalize the resultant triangular form. The requirements are $O(m)$ time and $1/4 n^{2} + O(n)$ processors.