A column-exchange modification to greedy volume-maximization subset selection achieves the same bounds on the pseudoinverse representation error as existing methods but with faster runtime for n much larger than m, plus a new upper bound on the number of exchanges needed.
Efficient algorithms for computing a strong rank- revealing qr factorization.SIAM Journal on Scientific Computing, 17(4), 07 1996
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subset selection for matrices by column exchange
A column-exchange modification to greedy volume-maximization subset selection achieves the same bounds on the pseudoinverse representation error as existing methods but with faster runtime for n much larger than m, plus a new upper bound on the number of exchanges needed.