The following pages link to Algorithm 971 (Q34477):
Displaying 11 items.
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition (Q1633018) (← links)
- Optimization of selective phenotyping and population design for genomic prediction (Q2084382) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- Algorithm 971 (Q3176327) (← links)
- Randomized near-neighbor graphs, giant components and applications in data science (Q3299443) (← links)
- Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation (Q4584924) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
- Best Low-rank Approximations and Kolmogorov $n$-widths (Q5857847) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
