How can I get the (approximate) eigenvectors of a huge matrix?

2 次查看(过去 30 天)
I have a huge symmetric matrix M and I want to get the eigenvectors to the k smallest eigenvalues of M (which have to be greater than 0). I know that the smallest eigenvalue is 0.
Currently I am using
eigs(M,k,eps)
but this results in memory consumption of over 100GB of RAM.
  3 个评论
Steffen
Steffen 2014-12-2
Actually I have 128GB but the systems also needs some resources. Nonetheless my memory is not enough. It was swapping something like 50GB so I don't know how much memory there would be needed... (Even 200GB might be not enough.)
Therefore I am open for suggestions. M is a 150k x 150k matrix. Are there any approximate methods which need much less memory?
Matt J
Matt J 2014-12-2
编辑:Matt J 2014-12-2
I don't really understand why it's taking so much memory. What happens when you do
eigs(M,k,'sm')

请先登录,再进行评论。

回答(2 个)

Thorsten
Thorsten 2014-12-2
If M contains many 0's you can define M as a sparse matrix to speed up computation.

Andrew Knyazev
Andrew Knyazev 2015-5-15

类别

Help CenterFile Exchange 中查找有关 Linear Algebra 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by