Metraipolis › archive › dc_4fe99fff9687

Randomized algorithms in numerical linear algebra for scientific computing — arXiv:2610.38157

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38157
License (as archived)
CC0-1.0
Archived
2026-11-01T02:35:55.829Z
SHA-256 of the archived text
eead150a5821e8bebbd0c8d729419c55bc1869ed9001a92e8b9f34315cc92d17
Stable URL of this page
https://metraipolis.com/documento/dc_4fe99fff9687

How to cite

Randomized algorithms in numerical linear algebra for scientific computing — arXiv:2610.38157 — arXiv (en), https://arxiv.org/abs/2610.38157 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4fe99fff9687 (Metraipolis archive dc_4fe99fff9687, sha256 eead150a5821e8bebbd0c8d729419c55bc1869ed9001a92e8b9f34315cc92d17)
BibTeX
@misc{dc4fe99fff9687,
  title = {Randomized algorithms in numerical linear algebra for scientific computing — arXiv:2610.38157},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38157},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4fe99fff9687; sha256 eead150a5821e8bebbd0c8d729419c55bc1869ed9001a92e8b9f34315cc92d17},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38157. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Randomized numerical linear algebra (RNLA) has fundamentally changed the landscape of scientific computing over the last twenty to thirty years. While early breakthroughs focused primarily on low-rank approximation and least-squares problems, randomized techniques are now used to solve a broad range of linear algebra problems, supporting applications spanning data science, optimization, and computational engineering. This paper surveys some of the main ideas of RNLA, focusing on methods that are effective in practice and on simple theoretical bounds that can be used to understand them. We highlight the core benefits of randomization: improved scalability, algorithmic simplicity, and---contrary to what the name may suggest---remarkable reliability and numerical stability. Topics include sketching, low-rank approximation, least squares, orthogonalization and approximate orthogonalization, randomized Krylov subspace methods, preconditioning, trace and spectral density estimation, row and column selection algorithms, posterior error estimation, randomized regularization, and tensor-structured randomness.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.38157 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:13.332Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).