Fast Eigen Decomposition for Low-Rank Matrix Approximation

Abstract: In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen decomposition of such matrices is though the singular value decomposition, which is available only if all the weights are nonnegative. Our proposed algorithm accepts both positive and negative weights.

This page was built for publication: Fast Eigen Decomposition for Low-Rank Matrix Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287590)