I asked
What is fastest way in Sage to compute biggest eigenvalue of a symmetric
matrix whose elements are positive integers?
and got answer to use
M=scipy.matrix(...)
scipy.linalg.eigh(M, eigvals=..., eigvals_only=True)
However, now I should compute smallest eigenvalues with bigger precision
than IEEE-745 floats. About 1000 bit should be enought. Is there an easy
way for that?
--
Jori Mäntysalo
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
