Deviation Maximization for Rank-Revealing QR Factorizations
arXiv:2106.03138 · doi:10.1007/s11075-022-01291-1
Abstract
In this paper we introduce a new column selection strategy, named here ``Deviation Maximization", and apply it to compute rank-revealing QR factorizations as an alternative to the well known block version of the QR factorization with the column pivoting method, called QP3 and currently implemented in LAPACK's xgeqp3 routine. We show that the resulting algorithm, named QRDM, has similar rank-revealing properties of QP3 and better execution times. We present numerical test results on a wide data set of numerically singular matrices, which has become a reference in the recent literature.
arXiv comment31 pages, 7 figures, submitted to Numerical Algorithms
References in corpus (5)
- Randomized QR with Column Pivoting
- Rectangular maximum-volume submatrices and their applications
- Fast Parallel Randomized QR with Column Pivoting Algorithms for Reliable Low-rank Matrix Approximations
- Direct solution of piecewise linear systems
- Blocked rank-revealing QR factorizations: How randomized sampling can be used to avoid single-vector pivoting