Sampling based succinct matrix approximation
From MaRDI portal
Publication:930090
DOI10.1016/j.spl.2007.11.009zbMath1416.65044OpenAlexW2046263715MaRDI QIDQ930090
Publication date: 19 June 2008
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2007.11.009
Random matrices (probabilistic aspects) (60B20) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concentration of eigenvalues of random symmetric matrices
- Sampling lower bounds via information theory
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- A Fast Random Sampling Algorithm for Sparsifying Matrices
- Using Linear Algebra for Intelligent Information Retrieval
- Fast computation of low rank matrix approximations
- Spectral techniques applied to sparse random graphs
- Fast monte-carlo algorithms for finding low-rank approximations
- Generalized low rank approximations of matrices