Ordering Givens Rotations for Sparse QR Factorization
DOI10.1137/S1064827593253343zbMATH Open0831.65045OpenAlexW2020893618MaRDI QIDQ4842580FDOQ4842580
Authors: M. I. Gillespie, D. D. Olesky 
Publication date: 15 August 1995
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827593253343
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
stabilityalgorithmbipartite graphGivens rotationslarge and sparse matrixsymbolic \(QR\) factorization
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Orthogonalization in numerical linear algebra (65F25)
Cited In (8)
- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- A survey of direct methods for sparse linear systems
- QR factorizations using a restricted set of rotations
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems
- Row Ordering for a Sparse QR Decomposition
- Sparsity Analysis of the $QR$ Factorization
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model
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)
