On graded QR decompositions of products of matrices
From MaRDI portal
(Redirected from Publication:1920171)
The author introduces a new method to compute the singular values and vectors of a product of \(n \times n\) matrices. The method is based on the successive factorization \(A_1 A_2 \dots A_m = QRP^T\), where \(Q\) is orthogonal, \(R\) is graded upper triangular, and \(P\) is a permutation matrix.
Recommendations
Cited in
(7)- SVD algorithms to approximate spectra of dynamical systems
- On the structure and geometry of the product singular value decomposition
- Exponential splittings of products of matrices and accurately computing singular values of long products
- Time-varying rational expectations models
- Optimal decompositions of matrices with grades into binary and graded matrices
- scientific article; zbMATH DE number 782068 (Why is no real title available?)
- Stable solutions of linear systems involving long chain of matrix multiplications
This page was built for publication: On graded QR decompositions of products of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920171)