how can i find k-eigenvalues faster than eig for hermitian dense matrix

2 次查看（过去 30 天）
vera duarte
vera duarte 2012-10-3
回答： Andrew Knyazev 2015-5-15
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?
thanks
  1 个评论
Matt J
Matt J 2012-10-3
Any special structure to the matrix, besides that it is Hermitian? It would be great if it were circulant, obviously.

请先登录，再进行评论。

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

回答（1 个）

Andrew Knyazev
Andrew Knyazev 2015-5-15

类别

在 Help Center 和 File Exchange 中查找有关 Eigenvalues & Eigenvectors 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by