An accurate product SVD algorithm (Q1180470)
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: An accurate product SVD algorithm |
scientific article; zbMATH DE number 25860
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An accurate product SVD algorithm |
scientific article; zbMATH DE number 25860 |
Statements
An accurate product SVD algorithm (English)
0 references
27 June 1992
0 references
A new algorithm is presented to compute the singular value decomposition of a product of 3 matrices, without explicitly forming the product. The method is based on a preliminary reduction of all three matrices to upper triangular form, followed by a product Jacobi-SVD algorithm. An error analysis and a proof of numerical stability, as well as numerical examples are provided.
0 references
singular value decomposition
0 references
product Jacobi-SVD algorithm
0 references
error analysis
0 references
numerical stability
0 references
numerical examples
0 references
