A derandomized row/column selection algorithm computes a cross approximation whose Frobenius-norm error is at most k+1 times the best rank-k error, in deterministic polynomial time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Low-rank approximation in the Frobenius norm by column and row subset selection
A derandomized row/column selection algorithm computes a cross approximation whose Frobenius-norm error is at most k+1 times the best rank-k error, in deterministic polynomial time.