An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition
From MaRDI portal
Recommendations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- A fast randomized algorithm for the approximation of matrices
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- A randomized algorithm for the decomposition of matrices
- Fast monte-carlo algorithms for finding low-rank approximations
Cited in
(10)- Fast singular value thresholding without singular value decomposition
- Stochastic boundary methods of fundamental solutions for solving PDEs
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- DHCC: divisive hierarchical clustering of categorical data
- Low-rank incremental methods for computing dominant singular subspaces
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Randomized singular spectrum analysis for long time series
- Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
This page was built for publication: An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415041)
