Algorithm 971
From MaRDI portal
Software:34477
swMATH22686MaRDI QIDQ34477FDOQ34477
Author name not available (Why is that?)
Cited In (11)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
- Algorithm 971
- Optimization of selective phenotyping and population design for genomic prediction
- Randomized Local Model Order Reduction
- Best Low-rank Approximations and Kolmogorov $n$-widths
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized near-neighbor graphs, giant components and applications in data science
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition
- Scalable Semidefinite Programming
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views
This page was built for software: Algorithm 971
