A QR-type reduction for computing the SVD of a general matrix product/quotient (Q1402183): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Bart De Moor / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Reginald P. Tewarson / rank | |||
Normal rank | |||
Revision as of 01:17, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A QR-type reduction for computing the SVD of a general matrix product/quotient |
scientific article |
Statements
A QR-type reduction for computing the SVD of a general matrix product/quotient (English)
0 references
19 August 2003
0 references
The authors study the computation of the singular value decomposition (SVD) of a general matrix product/quotient sequence. First, they reduce the sequence by QR-factorizations. Then using the Matlab command \(gsvd\) they produce the SVD. An advantage of the proposed QR-factorization is its flexibility of adding one more matrix from left or right of the original matrix product/quotient. This feature is very useful for the applications like the estimation of Lyapunov exponents of dynamic systems. Some numerical examples illustrating the proposed method are given.
0 references
singular value decomposition
0 references
algorithm
0 references
matrix reduction
0 references
matrix product
0 references
quotient sequence
0 references
QR factorization
0 references
Lyapunov exponents
0 references
dynamic systems
0 references
numerical examples
0 references
