Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition

DOI10.1145/3506691MaRDI QIDQ5865522zbMATH OpenOpenAlexWikidataFDO

Authors

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

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Recommendations

• A numerical study of efficient sampling strategies for randomized singular value decomposition
• Computing the singular value decomposition with high relative accuracy
• Fast ESPRIT algorithms based on partial singular value decompositions
• Fast algorithms for higher-order singular value decomposition from incomplete data
• On the Use of the Singular Value Decomposition in the Fast Multipole Method
• An efficient streaming algorithm for spectral proper orthogonal decomposition
• A fast and stable algorithm for downdating the singular value decomposition
• Accurate Singular Value Decompositions of Structured Matrices
• A new method to improve the efficiency and accuracy of incremental singular value decomposition
• On the efficient update of the singular value decomposition

Cites work

• A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
• A fast and efficient algorithm for low-rank approximation of a matrix
• A randomized algorithm for principal component analysis
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Algorithm 971
• An algorithm for the principal component analysis of large data sets
• Clustering large graphs via the singular value decomposition
• Fast computation of low-rank matrix approximations
• Fast low-rank modifications of the thin singular value decomposition
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Fast monte-carlo algorithms for finding low-rank approximations
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 1944953 (Why is no real title available?)
• scientific article; zbMATH DE number 1953870 (Why is no real title available?)
• scientific article; zbMATH DE number 2045498 (Why is no real title available?)
• Less is More: Sparse Graph Mining with Compact Matrix Decomposition
• Low-rank incremental methods for computing dominant singular subspaces
• Matrix approximation and projective clustering via volume sampling
• Matrix computations.
• Numerical Methods for Computing Angles Between Linear Subspaces
• Numerical methods in matrix computations
• Perturbation bounds in connection with singular value decomposition
• Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
• Relative-Error CUR Matrix Decompositions
• Subspace Iteration Randomization and Singular Value Problems
• Uniform sampling for matrix approximation

Cited in

(2)

• An Adaptive Way of Choosing Significant Snapshots for Proper Orthogonal Decomposition
• Improved convergence of the spectral proper orthogonal decomposition through time shifting

This page was built for publication: Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865522)