Fast approximate truncated SVD.
From MaRDI portal
Recommendations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- A fast randomized algorithm for the approximation of matrices
- Fast low-rank modifications of the thin singular value decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fast monte-carlo algorithms for finding low-rank approximations
Cited in
(23)- Accuracy of singular vectors obtained by projection-based SVD methods
- A split-and-merge approach for singular value decomposition of large-scale matrices
- Reduced basis decomposition: a certified and fast lossy data compression algorithm
- Model order reduction of port-Hamiltonian systems with inhomogeneous initial conditions via approximate finite-time Gramians
- A consistency theorem for randomized singular value decomposition
- Split-and-combine singular value decomposition for large-scale matrix
- AMID: approximation of multi-measured data using SVD
- An efficient truncated SVD of large matrices based on the low-rank approximation for inverse geophysical problems
- Structure and perturbation analysis of truncated SVDs for column-partitioned matrices
- The centroid decomposition: Relationships between discrete variational decompositions and SVDs
- A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
- A new truncation strategy for the higher-order singular value decomposition
- On the application of matrix singular value decomposition theory in Chinese text classification
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- scientific article; zbMATH DE number 125153 (Why is no real title available?)
- A Krylov-Schur approach to the truncated SVD
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- SVD row or column symmetric matrix
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- Differentiable parameter-less co-clustering using graph neural networks
- Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel
This page was built for publication: Fast approximate truncated SVD.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227193)
