Papers › Updating Singular Value Decomposition for Rank One Matrix Perturbation
Updating Singular Value Decomposition for Rank One Matrix Perturbation
Ratnik Gandhi, Amoli Rajgor
An efficient Singular Value Decomposition (SVD) algorithm is an important tool for distributed and streaming computation in big data problems. It is observed that update of singular vectors of a rank-1 perturbed matrix is similar to a Cauchy matrix-vector product. With this observation, in this paper, we present an efficient method for updating Singular Value Decomposition of rank-1 perturbed matrix in O(n² log(1/ϵ)) time. The method uses Fast Multipole Method (FMM) for updating singular vectors in O(n log (1/ϵ)) time, where ϵ is the precision of computation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections