Accelerating randomized algorithms for low-rank matrix approximation
From MaRDI portal
Cites work
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- A fast randomized algorithm for the approximation of matrices
- A randomized algorithm for principal component analysis
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- CUR matrix decompositions for improved data analysis
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Fast randomized numerical rank estimation for numerically low-rank matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Normal approximation and asymptotic expansions.
- Numerical linear algebra in the streaming model
- Practical sketching algorithms for low-rank matrix approximation
- Probability
- Randomized algorithms for the low-rank approximation of matrices
- Randomized numerical linear algebra: Foundations and algorithms
- Rang revealing QR factorizations
- Spectral analysis of large dimensional random matrices
- Streaming low-rank matrix approximation with an application to scientific simulation
- Subspace Iteration Randomization and Singular Value Problems
- Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
This page was built for publication: Accelerating randomized algorithms for low-rank matrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303890)
