-
Notifications
You must be signed in to change notification settings - Fork 3
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
Store patterns in BitMatrices instead of sets #137
Comments
I just read your comment in #135 (comment). |
As mentioned in #135 (comment), depending on the problem, it might actually be reasonable to use "dense" BitVectors and BitMatrices if we just allocate them once. |
Do you still want this or can I close the issue @gdalle? I can't imagine it being faster than |
I think for small and medium problems using a BitMatrix to store the sparsity pattern in shared (Walther) hessian mode would crush the competition |
So yeah I'd like to keep this issue open at the least |
I want to try this but it might require larger code changes than I thought.
A first hurdle is
myempty
: for a set it doesn't require further information, but for a sparse array we need to give the ambient size.The text was updated successfully, but these errors were encountered: