Structure-Preserving and Rank-Revealing QR-Factorizations
The authors present a framework for the efficient implementation of rank- revealing \(QR\)-factorization (RRQR-factorization) algorithms, in particular for sparse matrices. They propose to compute an initial \(QR\)- factorization using a restricted column-pivoting strategy guarded by an incremental condition estimation, and then to apply the algorithm suggested by \textit{T. F. Chan} [Linear Algebra Appl. 88/89, 67-81 (1987; Zbl 0624.65025)] and \textit{L. V. Foster} [ibid. 74, 47-71 (1986; Zbl 0589.65031)] to this \(QR\)-factorization. The column exchanges are restricted such that they do not produce extra fill-in. Some numerical experiments illustrate that the proposed initial \(QR\)- factorization produces a good approximate \(RRQR\)-factorization.
- Generalized QR factorization and its applications
- A block algorithm for computing rank-revealing QR factorizations
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- Improved bound for rank revealing LU factorizations
- Strong rank revealing Cholesky factorization
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Structural instability analyses based on generalised path-following
- Structures preserved by the QR-algorithm
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- Sparse Multifrontal Rank Revealing QR Factorization
- Communication avoiding rank revealing QR factorization with column pivoting
- On the Use of Structural Zeros in Orthogonal Factorization
- A QR-Based Solver for Rank Structured Matrices
- Some Applications of the Rank Revealing QR Factorization
- Rank Detection Methods for Sparse Matrices
- Low‐rank revealing QR factorizations
- scientific article; zbMATH DE number 4592 (Why is no real title available?)
- New parallel (rank-revealing) QR factorization algorithms
- Ordering Givens Rotations for Sparse QR Factorization
- A structure-preserving \(QR\) factorization for centrosymmetric real matrices
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- A survey of direct methods for sparse linear systems
- Rang revealing QR factorizations
- Exact QR factorizations of rectangular matrices
- Block discrete empirical interpolation methods
- Block generalized minimal residual method
- Sparse linear least-squares problems
- Rank structures preserved by the QR-algorithm: the singular case
- QR factorizations using a restricted set of rotations
This page was built for publication: Structure-Preserving and Rank-Revealing QR-Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982109)