A long time ago I did numerical eigenvalue computations using
SLEPC ( see http://www.grycap.upv.es/slepc/ )
There is also Trilinos/Anazazi (I did't use it)
But I was only interested in a part of the spectrum (smallest /largest),
Do you need to compute all eigenvalues?
Maybe (as William said) you
On Sat, Sep 13, 2014 at 11:52 AM, William A Stein wst...@uw.edu wrote:
On Sat, Sep 13, 2014 at 11:28 AM, Erik Slivken
wrote:
William-
I am trying to find the eigenvalues of a roughly 1x1 sparse matrix
with entries from {0,1} (and would like to do this for even larger
matrices). I
On 2014-09-13, William A Stein wst...@uw.edu wrote:
On Sat, Sep 13, 2014 at 11:52 AM, William A Stein wst...@uw.edu wrote:
On Sat, Sep 13, 2014 at 11:28 AM, Erik Slivken
wrote:
William-
I am trying to find the eigenvalues of a roughly 1x1 sparse matrix
with entries from {0,1} (and
On Saturday, September 13, 2014 9:26:33 PM UTC+1, Dima Pasechnik wrote:
(of course it's out of the question to compute the eigenvalues of an
arbitrary 0-1
sparse matrix of that kind of size, so one really has to go for the
largest one)
Depends of course on how many ones there are ;-)
