The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics

Abstract
We consider computing the singular value decomposition of a bidiagonal matrix B. Thisproblem arises in the singular value decomposition of a general matrix, and in the eigenproblemfor a symmetric positive definite tridiagonal matrix. We show that if the entries ofB are known with high relative accuracy, the singular values and singular vectors of B willbe determined to much higher accuracy than the standard perturbation theory suggests.We also show that the algorithm in [Demmel and Kahan] ...

This publication has 24 references indexed in Scilit: