“It is important to mention the role of randomized algorithms for approximate solutions. See this excellent and practical survey. https://arxiv.org/abs/2002.01387”
Randomized Numerical Linear Algebra: Foundations & Algorithms
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper treats both the theoretical foundations of the subject and the practical computational issues. Topics covered include norm estimation; matrix approximation by sampling; structured and unstructured random embeddings; linear regression problems; low-rank approximation; subspace iteration and Krylov methods; error estimation and adaptivity; interpolatory and CUR factorizations; Nyström approximation of positive-semidefinite matrices; single view ("streaming") algorithms; full rank-revealing factorizations; solvers for linear systems; and approximation of kernel matrices that arise in machine learning and in scientific computing.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及- Randomised numerical linear algebra: foundations and algorithms ↗jeremiecoullon · 2022-01-30 · 3 分
- Randomized Numerical Linear Algebra: Foundations and Algorithms ↗jeremiecoullon · 2023-01-03 · 2 分