Computing small singular values of bidiagonal matrices with guaranteed high relative accuracy: LAPACK working note number 3
Technical Report
·
OSTI ID:5039344
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. We present a new algorithm which computes all the singular values of a bidiagonal matrix to high relative accuracy independent of their magnitudes. 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. We also show how to accurately compute tiny eigenvalues of some classes of symmetric tridiagonal matrices using the same technique. 11 refs., 4 tabs.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38;
- OSTI ID:
- 5039344
- Report Number(s):
- ANL/MCS-TM-110; ON: DE88008465
- Country of Publication:
- United States
- Language:
- English
Similar Records
The bidiagonal singular value decomposition and Hamiltonian mechanics: LAPACK working note No. 11
A parallel algorithm for the singular value problem in bidiagonal matrices
Computing accurate eigensystems of scaled diagonally dominant matrices: LAPACK working note No. 7
Technical Report
·
Tue Aug 01 00:00:00 UTC 1989
·
OSTI ID:5841057
A parallel algorithm for the singular value problem in bidiagonal matrices
Conference
·
Fri Dec 01 00:00:00 UTC 1995
·
OSTI ID:125468
Computing accurate eigensystems of scaled diagonally dominant matrices: LAPACK working note No. 7
Technical Report
·
Thu Dec 01 00:00:00 UTC 1988
·
OSTI ID:6384861