Ordering Givens Rotations for Sparse QR Factorization
From MaRDI portal
Publication:4842580
Recommendations
- Row Ordering for a Sparse QR Decomposition
- A pipelined Givens method for computing the QR factorization of a sparse matrix
- Sparsity Analysis of the $QR$ Factorization
- Ordering, Anisotropy, and Factored Sparse Approximate Inverses
- scientific article; zbMATH DE number 712354
- Structure-Preserving and Rank-Revealing QR-Factorizations
- Computing rank-revealing QR factorizations of dense matrices
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- QR factorizations using a restricted set of rotations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Cited in
(8)- Sparsity Analysis of the $QR$ Factorization
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
- A survey of direct methods for sparse linear systems
- Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- QR factorizations using a restricted set of rotations
- Row Ordering for a Sparse QR Decomposition
- Householder reflections versus Givens rotations in sparse orthogonal decomposition
This page was built for publication: Ordering Givens Rotations for Sparse $QR$ Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842580)
