An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD (Q1855431): Difference between revisions
From MaRDI portal
Latest revision as of 12:19, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD |
scientific article |
Statements
An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD (English)
0 references
5 February 2003
0 references
The authors propose an agorithm which extends the relatively robust representations to the bidiagonal singular value decomposition (SVD) \(B=U\Sigma V^{T}\). The obtained numerical results are also compared with the LAPACK routines.
0 references
comparison of methods
0 references
bidiagonal
0 references
bidiagonal matrices
0 references
qd algorithms
0 references
numerical results
0 references
LAPACK routines
0 references
0 references
