Abstract
Convergence theorems are established with mathematical rigour for two algorithms for the computation of singular values of bidiogonal matrices: the differential quotient difference with shift (dqds) and the modified discrete Lotka-Volterra with shift (mdLVs). Global convergence is guaranteed under a fairly general assumption on the shift, and the asymptotic rate of convergence is 1.5 for the Johnson bound shift. This result for the mdLVs algorithm is a substantial improvement of the convergence analysis by Iwasaki and Nakamura. Numerical examples support these theoretical results.
