how can i find k-eigenvalues faster than eig for hermitian dense matrix
2 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaire
Matt J
le 3 Oct 2012
Any special structure to the matrix, besides that it is Hermitian? It would be great if it were circulant, obviously.
Réponses (1)
Voir également
Catégories
En savoir plus sur Linear Algebra dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!