guest ::
| Home > Publications database > Computing the bidiagonal SVD using multiple relatively robust representations |
| Home > Publications database > Computing the bidiagonal SVD using multiple relatively robust representations |
| Journal Article | PreJuSER-57019 |
; ;
2006
Soc.
Philadelphia, Pa.
This record in other databases: 
Please use a persistent id in citations: doi:10.1137/050628301
Abstract: We describe the design and implementation of a new algorithm for computing the singular value decomposition (SVD) of a real bidiagonal matrix. This algorithm uses ideas developed by Grosser and Lang that extend Parlett's and Dhillon's multiple relatively robust representations (MRRR) algorithm for the tridiagonal symmetric eigenproblem. One key feature of our new implementation is that k singular triplets can be computed using only O(nk) storage units and floating point operations, where n is the dimension of the matrix. The algorithm will be made available as routine xBDSCR in the upcoming new release of the LAPACK library.
Keyword(s): J ; bidiagonal singular value decomposition (auto) ; tridiagonal symmetric eigenproblem (auto) ; MRRR algorithm (auto) ; coupling relations (auto) ; LAPACK library (auto)
|
The record appears in these collections: |