Answers are grounded in this paper and cite their sources.
Computing the singular values of a bidiagonal matrix is the final phase of the standard algorithm for the singular value decomposition of a general matrix. A new algorithm that computes all the singular values of a bidiagonal matrix to high relative accuracy independent of their magnitudes is presented. In contrast, the standard algorithm for bidiagonal matrices may compute small singular values with no relative accuracy at all. Numerical experiments show that the new algorithm is comparable in speed to the standard algorithm, and frequently faster.
No takes yet. Share an insight, caveat, or question.
Demmel et al. (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: