Answers are grounded in this paper and cite their sources.
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems approximately, including matrix multiplication, regression and low-rank approximation. The survey describes the key ideas and gives complete proofs of the main results in the field. A central unifying idea is sampling the columns (or rows) of a matrix according to their squared lengths.
No takes yet. Share an insight, caveat, or question.
Kannan et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: