Prefer a chat interface with context about you and your work?
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Given an $m \times n$ matrix M with $m \geqslant n$, it is shown that there exists a permutation $\Pi $ and an integer k such that the QR factorization \[ M\Pi = Q\left( {\begin{array}{*{20}c} {A_k } & {B_k } \\ {} & {C_k } \\ \end{array} } \right) \] …