Pages that link to "Item:Q5172715"
From MaRDI portal
The following pages link to A fast and efficient algorithm for low-rank approximation of a matrix (Q5172715):
Displaying 11 items.
- Faster least squares approximation (Q623334) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- Effective implementation to reduce execution time of a low-rank matrix approximation problem (Q2231284) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)