Optimal eigenvalue approximation via sketching
From MaRDI portal
Publication:6499220
DOI10.1145/3564246.3585102MaRDI QIDQ6499220
David P. Woodruff, William J. Swartworth
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Spectral norm of products of random and deterministic matrices
- How many entries of a typical orthogonal matrix can be approximated by independent normals?
- Some limit theorems for the eigenvalues of a sample covariance matrix
- Low-Rank PSD Approximation in Input-Sparsity Time
- Optimal Approximate Matrix Product in Terms of Stable Rank
- High-Dimensional Probability
- Querying a Matrix through Matrix-Vector Products
- Testing Matrix Rank, Optimally
- On Approximating Matrix Norms in Data Streams
- New Algorithms for Heavy Hitters in Data Streams (Invited Talk)
- On Sketching Matrix Norms and the Top Singular Vector
- Eigenvalues of a matrix in the streaming model
This page was built for publication: Optimal eigenvalue approximation via sketching
