On 9 March 2016 at 20:09, Drimades wrote:
> I'm doing some tests with operations on numpy matrices in Python. As an
> example, it takes about 3000 seconds to compute eigenvalues and eigenvectors
> using scipy.linalg.eig(a) for a matrix 6000x6000. Is it an acceptable time?
I don't know really bu
On Thursday 10 March 2016 07:09, Drimades wrote:
> I'm doing some tests with operations on numpy matrices in Python. As an
> example, it takes about 3000 seconds to compute eigenvalues and
> eigenvectors using scipy.linalg.eig(a) for a matrix 6000x6000. Is it an
> acceptable time?
I don't know w
On 03/09/2016 09:09 PM, Drimades wrote:
Another thing to consider is that matrices I'm processing are heavily sparse.
Did you look at scipy.sparse.linalg ?
http://docs.scipy.org/doc/scipy/reference/sparse.linalg.html
--
https://mail.python.org/mailman/listinfo/python-list
I'm doing some tests with operations on numpy matrices in Python. As an
example, it takes about 3000 seconds to compute eigenvalues and eigenvectors
using scipy.linalg.eig(a) for a matrix 6000x6000. Is it an acceptable time? Any
suggestions to improve? Does C++ perform better with matrices? Anot
