A parallel algorithm for the singular value problem in bidiagonal matrices
Conference
·
OSTI ID:125468
- Universidad EAFIT, Medellian (Colombia)
- Michigan State Univ., East Lansing, MI (United States); and others
This paper describes a parallel algorithm for finding the singular values of a bidiagonal matrix B. The algorithm finds the largest singular values by finding the corresponding eigenvalues of the symmetric tridiagonal (ST) matrix B{sup T}B and taking the square roots of those eigenvalues. The smallest singular values are calculated by computing the corresponding eigenvalues of another ST matrix T, which contains zeroes in the main diagonal and entries of B in the off-diagonals. Details of two implementations of the algorithm are described. One implementation uses the split-merge algorithm to find the eigenvalues of ST matrices, and the other uses a bisection-based eigenvalue method. Performance results on an nCUBE-2 and a workstation cluster are presented.
- DOE Contract Number:
- FG02-93ER25167
- OSTI ID:
- 125468
- Report Number(s):
- CONF-950212--; CNN: Grant MIP-9204066; Grant CCR-9024840; Grant CDA-9121641; Grant CDA-9222901
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing small singular values of bidiagonal matrices with guaranteed high relative accuracy: LAPACK working note number 3
The bidiagonal singular value decomposition and Hamiltonian mechanics: LAPACK working note No. 11
Singular value decomposition utilizing parallel algorithms on graphical processors
Technical Report
·
Sun Jan 31 23:00:00 EST 1988
·
OSTI ID:5039344
The bidiagonal singular value decomposition and Hamiltonian mechanics: LAPACK working note No. 11
Technical Report
·
Tue Aug 01 00:00:00 EDT 1989
·
OSTI ID:5841057
Singular value decomposition utilizing parallel algorithms on graphical processors
Conference
·
Fri Dec 31 23:00:00 EST 2010
·
OSTI ID:1042857