Fast Eigen Decomposition for Low-Rank Matrix Approximation

06/07/2017
by   Youhei Akimoto, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2020

Single-pass randomized QLP decomposition for low-rank approximation

The QLP decomposition is one of the effective algorithms to approximate ...
research
12/12/2019

Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory

A fast non-convex low-rank matrix decomposition method for potential fie...
research
12/06/2009

On the numeric stability of the SFA implementation sfa-tk

Slow feature analysis (SFA) is a method for extracting slowly varying fe...
research
10/05/2013

Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds

Given a real matrix A with n columns, the problem is to approximate the ...
research
03/07/2022

Matrix Decomposition Perspective for Accuracy Assessment of Item Response Theory

The item response theory obtains the estimates and their confidence inte...
research
06/03/2021

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into ...
research
06/02/2018

Fast Rigid 3D Registration Solution: A Simple Method Free of SVD and Eigen-Decomposition

A novel solution is obtained to solve the rigid 3D registration problem,...

Please sign up or login with your details

Forgot password? Click here to reset