A new stable bidiagonal reduction algorithm (Q1774960)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new stable bidiagonal reduction algorithm |
scientific article; zbMATH DE number 2165348
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new stable bidiagonal reduction algorithm |
scientific article; zbMATH DE number 2165348 |
Statements
A new stable bidiagonal reduction algorithm (English)
0 references
4 May 2005
0 references
The authors propose a new bidiagonal reduction method for arbitrary rectangular matrices. Their new algorithm requires fewer floating point operations than the classical Golub-Kahan procedure. A perturbation analysis with optimal error bounds for the singular values of the bidiagonal factor is also presented.
0 references
singular value decomposition
0 references
bidiagonal matrix
0 references
error analysis
0 references
orthogonality
0 references
left orthogonal matrix
0 references
bidiagonal reduction method
0 references
algorithm
0 references
optimal error bounds
0 references
0 references
0 references
0 references
0.8715903
0 references
0.8625318
0 references
0.85713035
0 references
0.85559905
0 references
0.8533715
0 references
0.8500061
0 references
0.8498934
0 references
