Few Eigenvalues of Symmetric Sparse Graph

[Søren Hauberg]

tor, 04 12 2008 kl. 20:29 +0530, skrev Chaman Singh Verma:
> How can I find only few smallest eigenvalues and eigenvector of a
> large symmetric matrix. It seems
> that "eig(A)" calculates the entire spectrum.

You can use the 'arpack' package from Octave-Forge, it provides the
'eigs' function. Otherwise you can try JDQR
(http://www.math.uu.nl/people/vorst/JDQR.html). I haven't tried it yet,
but it should be very good.

Søren