One-sided reduction to bidiagonal form (Q1855440): Difference between revisions

The author presents an idea for reducing a rectangular matrix \(A\) to bidiagonal form which is based on the implicit reduction of the symmetric positive semidefinite matrix \(A^t A\) to tridiagonal form. A method based upon this idea may become a serious competitor (in terms of speed) for computing the singular values of large matrices and it is well suited for parallel processing. He gives also numerical evidence of the ability of his algorithm to accurately reduce to bidiagonal form \(A = DX\), where \(D\) is diagonal and \(X\) is wellconditioned.