Low-rank incremental methods for computing dominant singular subspaces

DOI10.1016/j.laa.2011.07.018zbMath1241.65036OpenAlexW2140839682MaRDI QIDQ413537

C. G. Baker, Paul Van Dooren, Kyle A. Gallivan

Publication date: 7 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.07.018

zbMATH Keywords

convergence analysisnumerical examplessingular value decompositioniterative methodsincremental SVDpass-efficient linear algebra

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

Incremental principal component pursuit for video background modeling, Convergence analysis of Oja's iteration for solving online PCA with nonzero-mean samples, SVD update methods for large matrices and applications, Toward an optimal a priori reduced basis strategy for frictional contact problems with LATIN solver, Feasible algorithm for linear mixed model for massive data, Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?, A new method to improve the efficiency and accuracy of incremental singular value decomposition, A new approach to proper orthogonal decomposition with difference quotients, Incremental proper orthogonal decomposition for PDE simulation data, A Nyström spectral clustering algorithm based on probability incremental sampling, SVD-based incremental approaches for recommender systems, Hierarchical Approximate Proper Orthogonal Decomposition, Error analysis of an incremental proper orthogonal decomposition algorithm for PDE simulation data, A DEIM Induced CUR Factorization, 6 The Loewner framework for system identification and reduction, Randomized linear algebra for model reduction. I. Galerkin methods and error estimation, A note on incremental POD algorithms for continuous time data, HDG-POD reduced order model of the heat equation, A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks, An enhanced algorithm for online proper orthogonal decomposition and its parallelization for unsteady simulations, Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition, Low-dimensional tracking of association structures in categorical data

Uses Software

• ARPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new stable bidiagonal reduction algorithm
• Fast low-rank modifications of the thin singular value decomposition
• Trust-region methods on Riemannian manifolds
• Sequential Karhunen-Loeve basis extraction and its application to images
• Matrix Algorithms
• A Jacobi--Davidson Type SVD Method
• Modifiable low-rank approximation to a matrix
• The WY Representation for Products of Householder Matrices
• A Storage-Efficient $WY$ Representation for Products of Householder Transformations
• Turbulence and the dynamics of coherent structures. I. Coherent structures
• ARPACK Users' Guide
• Recursive Calculation of Dominant Singular Subspaces
• A Symmetry Preserving Singular Value Decomposition
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition