Low‐rank revealing QR factorizations
- 1 January 1994
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 1 (1) , 33-44
Abstract
Rank revealing factorizations are used extensively in signal processing in connection with, for example, linear prediction and signal subspace algorithms. We present an algorithm for computing rank revealing QR factorizations of low‐rank matrices. The algorithm produces tight upper and lower bounds for all the largest singular values, thus making it particularly useful for treating rank deficient problems by means of subset selection, truncated QR, etc. The algorithm is similar in spirit to an algorithm suggested earlier by Chan for matrices with a small nullity, and it can also be considered as an extension of ordinary column pivoting.Keywords
This publication has 14 references indexed in Scilit:
- Rank revealing LU factorizationsLinear Algebra and its Applications, 1992
- An updating algorithm for subspace trackingIEEE Transactions on Signal Processing, 1992
- Rank-Revealing QR Factorizations and the Singular Value DecompositionMathematics of Computation, 1992
- On updating signal subspacesIEEE Transactions on Signal Processing, 1992
- Algorithm 686: FORTRAN subroutines for updating the QR decompositionACM Transactions on Mathematical Software, 1990
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-FactorizationsSIAM Journal on Scientific and Statistical Computing, 1990
- Incremental Condition EstimationSIAM Journal on Matrix Analysis and Applications, 1990
- Rank revealing QR factorizationsLinear Algebra and its Applications, 1987
- On the Existence and Computation of LU-Factorizations with Small PivotsMathematics of Computation, 1984
- Representations for the Generalized Inverse of a Partitioned MatrixJournal of the Society for Industrial and Applied Mathematics, 1964