Fast Monte-Carlo algorithms for finding low-rank approximations

DOI10.1109/SFCS.1998.743487MaRDI QIDQ6909484zbMATH OpenFDO

Authors R. Kannan, Alan Frieze, Santosh S. Vempala

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743487

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• Subspace method of moments for \textit{ab initio} 3-D single particle cryo-EM reconstruction
• Unique reconstruction for discretized inverse problems: a random sketching approach via subsampling
• librla: Randomized Linear Algebra Library
• Blind error estimation for CUR approximation
• Volume Sampling and Spectral Equalization in Randomized Alternating Projections
• Adaptive randomized pivoting and volume sampling

This page was built for publication: Fast Monte-Carlo algorithms for finding low-rank approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909484)