Optimal eigenvalue approximation via sketching
From MaRDI portal
Cites work
- Eigenvalues of a matrix in the streaming model
- High-dimensional probability. An introduction with applications in data science
- How many entries of a typical orthogonal matrix can be approximated by independent normals?
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Low-Rank PSD Approximation in Input-Sparsity Time
- New algorithms for heavy hitters in data streams (invited talk)
- On approximating matrix norms in data streams
- On sketching matrix norms and the top singular vector
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Querying a Matrix through Matrix-Vector Products
- Some limit theorems for the eigenvalues of a sample covariance matrix
- Spectral norm of products of random and deterministic matrices
- Testing matrix rank, optimally
Cited in
(4)- Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
- Fixed-sparsity matrix approximation from matrix-vector products
- Fast one-pass sparse approximation of the top eigenvectors of huge approximately low-rank matrices? Yes, MAM^!
- Decremental (1+)-approximate maximum eigenvector: dynamic power method
This page was built for publication: Optimal eigenvalue approximation via sketching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499220)
