A Rotation Method for Computing the QR-Decomposition
From MaRDI portal
Recommendations
Cited in
(17)- A triangular processor array for computing singular values
- A direct solution for pairwise rotations in Kaiser's varimax method
- Recursive cell rotation method
- On a modification of the QZ algorithm with fast Givens rotations
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- Algorithms for computing the QR decomposition of a set of matrices with common columns
- On the relation between pseudo-Hermiticity and dissipation
- Computation of outer inverses of tensors using the QR decomposition
- Squared Givens Rotation
- Systolic Networks for Orthogonal Decompositions
- Using qr-decompositions in the numerical solution of linear recurrence relations
- Computing theULfactorisation by newton's method
- Systolic computation of QZ matrix decomposition
- Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm
- NEW PARALLEL STRATEGIES FOR BLOCK UPDATING THE QR DECOMPOSITION∗
- QR factorizations using a restricted set of rotations
- Some complexity results in parallel matrix-based signal processing
This page was built for publication: A Rotation Method for Computing the QR-Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4725618)