A blocked randomized low-rank approximation algorithm reveals numerical rank adaptively to a spectral threshold, with new bounds on deflation accuracy.
orth” in step 9 of blarank with “ reorth2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation
A blocked randomized low-rank approximation algorithm reveals numerical rank adaptively to a spectral threshold, with new bounds on deflation accuracy.