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

Check if per-matrix sparsity (automatic) makes sense #90

Open
greschd opened this issue Sep 4, 2020 · 0 comments
Open

Check if per-matrix sparsity (automatic) makes sense #90

greschd opened this issue Sep 4, 2020 · 0 comments

Comments

@greschd
Copy link
Member

greschd commented Sep 4, 2020

Currently, the hopping matrices can either all be stored as dense matrices, or all sparse. It might make sense to mix sparse and dense matrices though.

Since there's anyway a compatibility layer in the form of _array_cast and empty_matrix, it might not be too hard to implement.

What's more difficult is probably adjusting the sparsity dynamically. A good starting point could be analyzing the matrices in set_sparse, and then set each according to some heuristic for the filling factor (adjustable?).

To be checked:

  • Find some models where mixed sparse / dense provides measurable benefit.
  • Find cut-off where storing dense / sparse is more efficient
  • Check impact on Hamiltonian evaluation
  • Are there places where matrix manipulation relies on it all being the same data type?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant