A block algorithm for computing rank-revealing QR factorizations
From MaRDI portal
The authors present a block algorithm for computing rank-revealing \(QR\) factorizations of rank deficient matrices. The algorithm clearly identifies groups of small singular values. It is shown that the proposed algorithm produces the correct solution under very weak assumptions for the orthogonal factorization used for the nullspace matrix. Numerical experiments are given showing the reliability of the algorithms, which is particularly attractive for sparse matrices and high performance computer architectures.
Recommendations
Cites work
- A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- A Storage-Efficient WY Representation for Products of Householder Transformations
- Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
- An Application of Systolic Arrays to Linear Discrete Ill-Posed Problems
- An iterative method for computing multivariate C^ 1 piecewise polynomial interpolants
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Incremental Condition Estimation
- Numerical methods for solving linear least squares problems
- Rang revealing QR factorizations
- Rank and null space calculations using matrix decomposition without column interchanges
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Some Applications of the Rank Revealing QR Factorization
- Structure-Preserving and Rank-Revealing QR-Factorizations
- The Modified Truncated SVD Method for Regularization in General Form
- The WY Representation for Products of Householder Matrices
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
Cited in
(22)- On the existence and computation of rank-revealing LU factorizations
- Structural instability analyses based on generalised path-following
- Rank revealing Gaussian elimination by the maximum volume concept
- Deviation maximization for rank-revealing QR factorizations
- Block factorizations and qd-type transformations for the \(\mathrm{MR}^3\) algorithm
- Computing symmetric rank-revealing decompositions via triangular factorization
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Sparse Multifrontal Rank Revealing QR Factorization
- scientific article; zbMATH DE number 5575550 (Why is no real title available?)
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Rank Detection Methods for Sparse Matrices
- scientific article; zbMATH DE number 2090652 (Why is no real title available?)
- scientific article; zbMATH DE number 833735 (Why is no real title available?)
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A variation of RRQR decomposition based on Gershgorin disk theorem
- Rang revealing QR factorizations
- \(qd\) block algorithm
- Efficient algorithms for computing rank‐revealing factorizations on a GPU
- Block generalized minimal residual method
- Sparse linear least-squares problems
- Rank structures preserved by the QR-algorithm: the singular case
This page was built for publication: A block algorithm for computing rank-revealing QR factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200543)
