Updating the singular value decomposition

DOI10.1007/BF01397471zbMath0421.65028MaRDI QIDQ5904200

James R. Bunch, Christopher P. Nielsen

Publication date: 1978

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132571

zbMATH Keywords

singular value decompositionleast squares problem

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

Improving the condition number of a simple eigenvalue by a rank one matrix ⋮ Incremental principal component pursuit for video background modeling ⋮ A fast and stable algorithm for downdating the singular value decomposition ⋮ Streaming Principal Component Analysis From Incomplete Data ⋮ Fast low-rank modifications of the thin singular value decomposition ⋮ Subspace-based noise reduction for speech signals via diagonal and triangular matrix decompositions: survey and analysis ⋮ SVD update methods for large matrices and applications ⋮ Two-way bidiagonalization scheme for downdating the singular-value decomposition ⋮ Choosing among imputation techniques for incomplete multivariate data: a simulation study ⋮ Inheritance of the discrete Picard condition in Krylov subspace methods ⋮ Auto-association by multilayer perceptrons and singular value decomposition ⋮ Square-root Householder subspace tracking ⋮ Autoencoders reloaded ⋮ Unnamed Item ⋮ Numerical behaviour of the modified Gram-Schmidt GMRES implementation ⋮ Efficiently updating and tracking the dominant kernel principal components ⋮ Toward an optimal a priori reduced basis strategy for frictional contact problems with LATIN solver ⋮ A numerical comparison of methods for solving secular equations ⋮ Constructive subsampling of finite frames with applications in optimal function recovery ⋮ Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix ⋮ Note on a rank-one modification of the singular value decomposition ⋮ Numerical strategies for recursive least squares solutions to the matrix equation AX = B ⋮ A new method to improve the efficiency and accuracy of incremental singular value decomposition ⋮ Incremental algorithms for truncated higher-order singular value decompositions ⋮ Geometric Subspace Updates with Applications to Online Adaptive Nonlinear Model Reduction ⋮ A unifying convergence analysis of second-order methods for secular equations ⋮ A geometric approach to subspace updates and orthogonal matrix decompositions under rank-one modifications ⋮ Adaptive Lanczos methods for recursive condition estimation ⋮ Analysis of third-order methods for secular equations ⋮ The beta-Wishart ensemble ⋮ Computable eigenvalue bounds for rank-\(k\) perturbations ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths ⋮ Robust and adaptive algorithms for online portfolio selection ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ Rank-one modification of the symmetric eigenproblem ⋮ Unnamed Item ⋮ An Accelerated Greedy Missing Point Estimation Procedure ⋮ A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks ⋮ Incremental CP Tensor Decomposition by Alternating Minimization Method ⋮ Recursive prediction of chaotic time series ⋮ Rank and null space calculations using matrix decomposition without column interchanges

Cites Work

• A direct error analysis for least squares
• The behavior of eigenvalues and singular values under perturbations of restricted rank
• Rank-one modification of the symmetric eigenproblem
• Some Modified Matrix Eigenvalue Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Updating the singular value decomposition