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
I was wondering if it's possible to recompute the eigenvalue decomposition without re-instantiating the solver? Say, I have a sequence of sparse symmetric matrices of the same size and sparsity pattern. I would like to avoid unnecessary memory allocations. Is there a trick to achieve this with the current implementation?
Thanks,
Peter
The text was updated successfully, but these errors were encountered:
Dear authors,
I was wondering if it's possible to recompute the eigenvalue decomposition without re-instantiating the solver? Say, I have a sequence of sparse symmetric matrices of the same size and sparsity pattern. I would like to avoid unnecessary memory allocations. Is there a trick to achieve this with the current implementation?
Thanks,
Peter
The text was updated successfully, but these errors were encountered: