We extend a cubically convergent method for the Hermitian eigenvalue problem [7] to the case of computing the singular value decomposition of a general matrix. We propose an algorithm that only uses matrix-matrix multiplications and QR decompositions. We examine several of the subtleties in the derivation of the algorithm, and we also present a rigorous convergence analysis.
展开▼
