A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks

DOI10.1137/16M1058467zbMath1349.15041arXiv1601.07010MaRDI QIDQ2834696

No author found.

Publication date: 23 November 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.07010

zbMATH Keywords

singular value decompositiondistributed computinglow-rank approximationsincremental SVD

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

`On-the-fly' snapshots selection for proper orthogonal decomposition with application to nonlinear dynamics ⋮ A new method to improve the efficiency and accuracy of incremental singular value decomposition ⋮ An incremental singular value decomposition approach for large-scale spatially parallel \& distributed but temporally serial data -- applied to technical flows ⋮ On recovery guarantees for one-bit compressed sensing on manifolds ⋮ Hierarchical Approximate Proper Orthogonal Decomposition ⋮ Error analysis of an incremental proper orthogonal decomposition algorithm for PDE simulation data ⋮ A note on incremental POD algorithms for continuous time data ⋮ HDG-POD reduced order model of the heat equation ⋮ An enhanced algorithm for online proper orthogonal decomposition and its parallelization for unsteady simulations ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition

Uses Software

• PAPI
• Hadoop
• MAGMA
• PLASMA
• MLlib
• Spark
• Apache Spark

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor-Train Decomposition
• Low-rank incremental methods for computing dominant singular subspaces
• Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
• Rank-one modification of the symmetric eigenproblem
• Principal component analysis.
• On incremental and robust subspace learning
• Fast low-rank modifications of the thin singular value decomposition
• Communication-optimal Parallel and Sequential QR and LU Factorizations
• High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
• A Singular Value Decomposition Updating Algorithm for Subspace Tracking
• A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A Multilinear Singular Value Decomposition
• On Updating Problems in Latent Semantic Indexing
• Downdating the Singular Value Decomposition
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Some Modified Matrix Eigenvalue Problems
• Updating the singular value decomposition