Accurate Singular Values of Bidiagonal Matrices
- 1 September 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 11 (5) , 873-912
- https://doi.org/10.1137/0911052
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Computing Accurate Eigensystems of Scaled Diagonally Dominant MatricesSIAM Journal on Numerical Analysis, 1990
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular valuesJournal of Computational and Applied Mathematics, 1987
- Distribution of mathematical software via electronic mailCommunications of the ACM, 1987
- A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue ProblemSIAM Journal on Scientific and Statistical Computing, 1987
- Efficient Algorithms for Computing the Condition Number of a Tridiagonal MatrixSIAM Journal on Scientific and Statistical Computing, 1986
- Underflow and the Reliability of Numerical SoftwareSIAM Journal on Scientific and Statistical Computing, 1984
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue ProblemsSIAM Review, 1973
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965