Is the basic Golub and Reinsch algorithm for calculating the SVD guaranteed to converge?

226 Views Asked by At

It seems like the algorithm for calculating the SVD depends on an implicit implementation of the shifted QR algorithm to diagonalize a bidiagonal matrix, but the QR algorithm isnt guaranteed to always converge except under special conditions (the only one of which I could find is for when the absolute values of the eigenvalues are distinct). Does this mean this algorithm isnt guaranteed to converge as well?