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 CenterFile Exchange에서 Linear Algebra에 대해 자세히 알아보기

Community Treasure Hunt

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

Start Hunting!

Translated by