.png){kind=icon}
返回
Randomized algorithms in numerical linear algebra
.png){kind=icon}
PRE
AI
DOI：10.1017/S0962492917000058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
MONTE-CARLO ALGORITHMS
LARGE MATRICES
APPROXIMATION
COMPUTATION
JOHNSON
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。