how can i find k-eigenvalues faster than eig for hermitian dense matrix
2 views (last 30 days)
Show older comments
vera duarte on 3 Oct 2012
Answered: Andrew Knyazev on 15 May 2015
Hi! eigs is not faster than eig for large hermitian dense matrix. I need many eigenvalues. For a matrix n > 2000 elements, i need to find the 250 largest eigenvalues. I think that the divide and conquer method or bissection method.
are there routines( or package) for these methods?
Matt J on 3 Oct 2012
Any special structure to the matrix, besides that it is Hermitian? It would be great if it were circulant, obviously.
Andrew Knyazev on 15 May 2015
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!