The following pages link to Algorithm 971 (Q3176327):
Displayed 20 items.
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition (Q1633018) (← links)
- Randomized model order reduction (Q2000522) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Optimization of selective phenotyping and population design for genomic prediction (Q2084382) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← 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)
- (Q4637072) (← 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)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation (Q6073724) (← links)
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices (Q6094751) (← links)
- A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes (Q6143819) (← links)
- Randomized Nyström Preconditioning (Q6166051) (← links)
- Learning to Forecast Dynamical Systems from Streaming Data (Q6168204) (← links)
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation (Q6180350) (← links)