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

6 ビュー (過去 30 日間)
Steffen
Steffen 2014 年 12 月 2 日
回答済み: Andrew Knyazev 2015 年 5 月 15 日
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.
  1 件のコメント
Steffen
Steffen 2014 年 12 月 8 日
M is already defined as sparse. I construct the matrix by using spconvert().

サインインしてコメントする。


Andrew Knyazev
Andrew Knyazev 2015 年 5 月 15 日

カテゴリ

Help Center および File ExchangeLinear Algebra についてさらに検索

Community Treasure Hunt

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

Start Hunting!

Translated by