Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Efficiently recompute eigenvalues #110

Open
petlist opened this issue Dec 17, 2020 · 0 comments
Open

Efficiently recompute eigenvalues #110

petlist opened this issue Dec 17, 2020 · 0 comments

Comments

@petlist
Copy link

petlist commented Dec 17, 2020

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant