Sifted Randomized Singular Value Decomposition

11/26/2019

∙

by   Ali Basirat, et al.

∙

13

∙

share

We extend the randomized singular value decomposition (SVD) algorithm <cit.> to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the original algorithm, the extended algorithm provides for a more efficient way of matrix factorization. The algorithm facilitates the low-rank approximation and principal component analysis (PCA) of off-center data matrices. When applied to different types of data matrices, our experimental results confirm the advantages of the extensions made to the original algorithm.