Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
From MaRDI portal
Publication:5865522
DOI10.1145/3506691OpenAlexW3101817049WikidataQ113309847 ScholiaQ113309847MaRDI QIDQ5865522
No author found.
Publication date: 9 June 2022
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05107
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Low-rank incremental methods for computing dominant singular subspaces
- Clustering large graphs via the singular value decomposition
- Matrix computations.
- Fast low-rank modifications of the thin singular value decomposition
- A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks
- Uniform Sampling for Matrix Approximation
- An Algorithm for the Principal Component Analysis of Large Data Sets
- Algorithm 971
- Fast computation of low-rank matrix approximations
- Matrix approximation and projective clustering via volume sampling
- A Randomized Algorithm for Principal Component Analysis
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Relative-Error $CUR$ Matrix Decompositions
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Numerical Methods for Computing Angles Between Linear Subspaces
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- A fast and efficient algorithm for low-rank approximation of a matrix
- Subspace Iteration Randomization and Singular Value Problems
- Numerical Methods in Matrix Computations
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Perturbation bounds in connection with singular value decomposition