how can i find k-eigenvalues faster than eig for hermitian dense matrix
2 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
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 comentario
Matt J
el 3 de Oct. de 2012
Any special structure to the matrix, besides that it is Hermitian? It would be great if it were circulant, obviously.
Respuestas (1)
Ver también
Categorías
Más información sobre Linear Algebra en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!