EUVIMEDEUVIMED entdecken
Crossref

Randomized numerical linear algebra: Foundations and algorithms

Per-Gunnar Martinsson, Joel A. Tropp

Acta Numerica · 2020-05 · 29 · 403-572

DOI: 10.1017/s0962492920000021 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Acta Numerica, online erschienen am 30.11.2020. Verfasst von Per-Gunnar Martinsson und 1 weiteren Autor:innen. Die Arbeit wurde bisher 327-mal zitiert (Crossref) und nennt 301 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This survey describes probabilistic algorithms for linear algebraic computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problems. The paper treats both the theoretical foundations of the subject and practical computational issues. Topics 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.

Zitieren

APA

Martinsson, P., & Tropp, J. A. (2020). Randomized numerical linear algebra: Foundations and algorithms. Acta Numerica, 29, 403-572. https://doi.org/10.1017/s0962492920000021

Vancouver

Martinsson P, Tropp JA. Randomized numerical linear algebra: Foundations and algorithms. Acta Numerica. 2020;29:403-572. doi:10.1017/s0962492920000021

BibTeX
@article{Martinsson2020,
  author = {Martinsson, Per-Gunnar and Tropp, Joel A.},
  title = {Randomized numerical linear algebra: Foundations and algorithms},
  journal = {Acta Numerica},
  year = {2020},
  volume = {29},
  pages = {403--572},
  doi = {10.1017/s0962492920000021}
}
Kostenlos starten →