how can i find k-eigenvalues faster than eig for hermitian dense matrix
1 次查看(过去 30 天)
显示 更早的评论
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
2012-10-3
Any special structure to the matrix, besides that it is Hermitian? It would be great if it were circulant, obviously.
回答(1 个)
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!