Triangular processor array for computing singular values
Franklin T. Luk · Linear Algebra and its Applications · 1986
A triangular processor array for computing the singular values of an m×n (m⩾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 14n2 + 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 12mn + O(m) processors for the computational of singular vectors.