scientific article; zbMATH DE number 7256146
From MaRDI portal
Publication:5125449
zbMath1463.65072MaRDI QIDQ5125449
Saifon Chaturantabut, Siriwan Intawichai
Publication date: 7 October 2020
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4486
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomized singular value decompositionuniform samplingGaussian samplingsparse samplingK-mean clustering
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52)
Related Items (2)
Unnamed Item ⋮ Stabilized model reduction for nonlinear dynamical systems through a contractivity-preserving framework
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Randomized algorithms for the low-rank approximation of matrices
- Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval
- Randomized Algorithms for Matrices and Data
- Fast computation of low-rank matrix approximations
- On the Early History of the Singular Value Decomposition
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
This page was built for publication:
