A triangular processor array for computing singular values (Q1072344)

A triangular processor array for computing the singular values 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 \((1/4)n^ 2+O(n)\) processors and \(O(m+nS)\) time, where S denotes the number of sweeps. The ''triangular'' array can be extended to a ''rectangular'' one with \(mn+O(m)\) processors for the computation of singular vectors.