Summary.
We have discovered a new implementation of the qd algorithm that has a far wider domain of stability than Rutishauser's version. Our algorithm was developed from an examination of the {Cholesky~LR} transformation and can be adapted to parallel computation in stark contrast to traditional qd. Our algorithm also yields useful a posteriori upper and lower bounds on the smallest singular value of a bidiagonal matrix. The zero-shift bidiagonal QR of Demmel and Kahan computes the smallest singular values to maximal relative accuracy and the others to maximal absolute accuracy with little or no degradation in efficiency when compared with the LINPACK code. Our algorithm obtains maximal relative accuracy for all the singular values and runs at least four times faster than the LINPACK code.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received August 8, 1993/Revised version received May 26, 1993
Rights and permissions
About this article
Cite this article
Fernando, K., Parlett, B. Accurate singular values and differential qd algorithms. Numer. Math. 67, 191–229 (1994). https://doi.org/10.1007/s002110050024
Issue Date:
DOI: https://doi.org/10.1007/s002110050024