A block algorithm for computing rank-revealing QR factorizations
DOI10.1007/BF02139475zbMATH Open0761.65029WikidataQ114233881 ScholiaQ114233881MaRDI QIDQ1200543FDOQ1200543
Authors: Christian H. Bischof, Per Christian Hansen 
Publication date: 16 January 1993
Published in: Numerical Algorithms (Search for Journal in Brave)
Recommendations
singular valuesblock algorithmNumerical experimentsrank determinationrank-revealing \(QR\) factorizations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Rang revealing QR factorizations
- Numerical methods for solving linear least squares problems
- Title not available (Why is that?)
- Structure-Preserving and Rank-Revealing QR-Factorizations
- Title not available (Why is that?)
- Some Applications of the Rank Revealing QR Factorization
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- The WY Representation for Products of Householder Matrices
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- An Application of Systolic Arrays to Linear Discrete Ill-Posed Problems
- Rank and null space calculations using matrix decomposition without column interchanges
- The Modified Truncated SVD Method for Regularization in General Form
- An iterative method for computing multivariate \(C^ 1\) piecewise polynomial interpolants
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
- Incremental Condition Estimation
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- Adaptive Condition Estimation for Rank-One Updates of QR Factorizations
Cited In (18)
- Rank revealing Gaussian elimination by the maximum volume concept
- Rank structures preserved by the \(QR\)-algorithm: the singular case
- Efficient algorithms for computing rank‐revealing factorizations on a GPU
- Block factorizations and qd-type transformations for the \(\mathrm{MR}^3\) algorithm
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- Title not available (Why is that?)
- Rank Detection Methods for Sparse Matrices
- \(qd\) block algorithm
- Title not available (Why is that?)
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Rang revealing QR factorizations
- Title not available (Why is that?)
- Computing symmetric rank-revealing decompositions via triangular factorization
- Structural instability analyses based on generalised path-following
- On the existence and computation of rank-revealing LU factorizations
- A variation of RRQR decomposition based on Gershgorin disk theorem
- Deviation maximization for rank-revealing QR factorizations
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)
