A block QR algorithm and the singular value decomposition
From MaRDI portal
Publication:2365660
Recommendations
- A QR-method for computing the singular values via semiseparable matrices
- Analysis of a QR Algorithm for Computing Singular Values
- An accurate SVD algorithm for 2 by 2 triangular matrices
- The QRPS algorithm: A generalization of the QR algorithm for the singular value decomposition of rectangular matrices
- Convergence to singular triplets in the two-sided block-Jacobi SVD algorithm with dynamic ordering
Cites work
Cited in
(13)- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Randomized quaternion QLP decomposition for low-rank approximation
- The QRPS algorithm: A generalization of the QR algorithm for the singular value decomposition of rectangular matrices
- On the \(QR\) algorithm and updating the \(SVD\) and the \(URV\) decomposition in parallel
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- Modifiable low-rank approximation to a matrix
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- Block factorizations and qd-type transformations for the \(\mathrm{MR}^3\) algorithm
- scientific article; zbMATH DE number 833735 (Why is no real title available?)
- Randomized numerical linear algebra: Foundations and algorithms
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- Convergence analysis of the block Householder diagonalization algorithm
- Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics
This page was built for publication: A block QR algorithm and the singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365660)