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
Currently, the eigenvalues are computed using numpy.linalg.eigh, which returns all eigenvalues of a matrix. For large matrices, it could be much more efficient to use instead something like scipy.sparse.linalg.eig, where only a specified number of eigenvalues is computed. To make this compatible with the 'autograd' backend, an autograd primitive should be defined for that function, which shouldn't be too hard starting from the primitive for numpy.linalg.eigh, which can already be found in pygme.primitives.py.
The text was updated successfully, but these errors were encountered:
Currently, the eigenvalues are computed using
numpy.linalg.eigh
, which returns all eigenvalues of a matrix. For large matrices, it could be much more efficient to use instead something likescipy.sparse.linalg.eig
, where only a specified number of eigenvalues is computed. To make this compatible with the 'autograd' backend, an autograd primitive should be defined for that function, which shouldn't be too hard starting from the primitive fornumpy.linalg.eigh
, which can already be found inpygme.primitives.py
.The text was updated successfully, but these errors were encountered: