how can i find k-eigenvalues faster than eig for hermitian dense matrix
2 ビュー (過去 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!