Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Open Access
- 1 July 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 17 (4) , 848-869
- https://doi.org/10.1137/0917055
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- On Rank-Revealing FactorisationsSIAM Journal on Matrix Analysis and Applications, 1994
- A block algorithm for computing rank-revealing QR factorizationsNumerical Algorithms, 1992
- SOME APPLICATIONS OF THE RANK REVEALING QR FACTORIZATIONSIAM Journal on Scientific and Statistical Computing, 1992
- On updating signal subspacesIEEE Transactions on Signal Processing, 1992
- Structure-Preserving and Rank-Revealing QR-FactorizationsSIAM Journal on Scientific and Statistical Computing, 1991
- 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
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencilLinear Algebra and its Applications, 1988
- Rank revealing QR factorizationsLinear Algebra and its Applications, 1987
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965