Eigenvalue decomposition of very large matrices

17 次查看（过去 30 天）
Conor
Conor 2014-2-4
评论： Matt J 2014-2-4
I'm doing a spectral decomposition of symmetric positive matrices. I have a 16Gb machine and can compute the evalues and evectors for a 30k x 30k matrix in reasonable time (~2hr). I need to scale up to a matrix 20 times that size. As eig is cubic this would take a couple of years.
I have access to a cluster that has a matlab parallel licence but am not sure how to proceed. All advice is much appreciated.
Thanks in advance.
  1 个评论
Matt J
Matt J 2014-2-4
编辑：Matt J 2014-2-4
I'm naturally suspicious of anything that looks like it requires that much brute force compute power.
Are you sure your matrix has no special structure to it that could be exploited other than symmetry and positivity? Is the matrix really "positive" or did you mean "positive definite"?

请先登录，再进行评论。

请先登录，再回答此问题。

回答（1 个）

Paul
Paul 2014-2-4
编辑：Paul 2014-2-4
If you have a sparse matrix (lots of zeros), you should use eigs (determines the eigenvalues of a sparse matrix). First declare the matrix sparse by doing:
M=sparse(M);
eigval = eigs(M,30000);
Normally eigs returns the 6 largest eigenvalues. The second argument of eigs in this case is the number of eigenvalues you want. If you want them all, put 30000 there.
  3 个评论
显示 1更早的评论
Paul
Paul 2014-2-4
Hmm you are right, if you actually want all eigenvalues Matlab uses the eig alghorithm. If you dont want them all though, but only the largest k eigenvalues, eigs should be faster.
Matt J
Matt J 2014-2-4
Conor commented
Unfortunately my matrix starts out as sparse but I need to transform it by subtracting it from 1.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Linear Algebra 的更多信息

标签

产品

Community Treasure Hunt

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

Start Hunting!

Translated by