A new method to improve the efficiency and accuracy of incremental singular value decomposition

DOI10.13001/ELA.2023.7325MaRDI QIDQ6114792zbMATH OpenOpenAlexFDO

Authors Arin Chaudhuri

Publication date 15 August 2023

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://journals.uwyo.edu/index.php/ela/article/view/7325

zbMATH Keywords

matrix factorizationonline learningprincipal component analysissingular value decomposition

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Online algorithms; streaming algorithms (68W27)

Recommendations

• Low-rank incremental methods for computing dominant singular subspaces
• A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
• Fast low-rank modifications of the thin singular value decomposition
• A Singular Value Decomposition Updating Algorithm for Subspace Tracking
• scientific article; zbMATH DE number 2045498

Cites work

• A distributed and incremental SVD algorithm for agglomerative data analysis on large networks
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
• Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
• Fast low-rank modifications of the thin singular value decomposition
• Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 2045498 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Incremental principal component pursuit for video background modeling
• Low-rank incremental methods for computing dominant singular subspaces
• On incremental and robust subspace learning
• On the efficient update of the singular value decomposition
• On Updating Problems in Latent Semantic Indexing
• Rank my update, please
• Recursive Calculation of Dominant Singular Subspaces
• Structure and perturbation analysis of truncated SVDs for column-partitioned matrices
• SVD-based incremental approaches for recommender systems
• Updating the singular value decomposition
• Using Linear Algebra for Intelligent Information Retrieval

Cited in

(4)

• scientific article; zbMATH DE number 2045498 (Why is no real title available?)
• Incremental Calculation Framework for Complex Data
• Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
• Convex set-oriented singular value decomposition with bounded uncertainties

This page was built for publication: A new method to improve the efficiency and accuracy of incremental singular value decomposition

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