How can I get the (approximate) eigenvectors of a huge matrix?
3 views (last 30 days)
Show older comments
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.
Answers (2)
Thorsten
on 2 Dec 2014
If M contains many 0's you can define M as a sparse matrix to speed up computation.
See Also
Categories
Find more on Linear Algebra in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!