You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 10, 2017. It is now read-only.
Right now MTJ's ArpackSym.java supports A*x = lambda*x.
I'm looking for a fast sparse solver for A*x = lambda*M*x. It looks like dsaupd supports the generalized eigenvector problem, but ArpackSym.java doesn't yet implement it.
that'd be great. Do you know ARPACK and the examples that it comes with? I basically translated the simple symmetric solver into java to get ArpackSym.
Right now MTJ's ArpackSym.java supports
A*x = lambda*x
.I'm looking for a fast sparse solver for
A*x = lambda*M*x
. It looks like dsaupd supports the generalized eigenvector problem, but ArpackSym.java doesn't yet implement it.Thanks for the excellent library!
Want to back this issue? Post a bounty on it! We accept bounties via Bountysource.
The text was updated successfully, but these errors were encountered: