Skip to content
New issue

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

#

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

Already on GitHub? # to your account

Jump to bottom

coo #869

Draft
wants to merge 2 commits into
base: master
Choose a base branch
from
Draft

coo #869

wants to merge 2 commits into from

Conversation

joostvanzwieten
Copy link
Member

No description provided.

@joostvanzwieten joostvanzwieten force-pushed the coo branch 2 times, most recently from bbaa26a to fc09963 Compare April 23, 2024 14:33
@joostvanzwieten joostvanzwieten force-pushed the coo branch 28 times, most recently from 439cb23 to 8d27334 Compare May 14, 2024 07:28
@joostvanzwieten joostvanzwieten force-pushed the coo branch 12 times, most recently from a16614b to d6aa644 Compare May 17, 2024 09:25
@joostvanzwieten
disable testing sparse evaluation of bool arrays
3566344
@joostvanzwieten
assemble into sorted and deduped coo directly
2ae40b8 
Currently we assemble sparse matrices as unstructured coo with repeated indices
and sort and dedup later. The downside of this approach is that we're wasting
memory because of the duplicated indices, and if we're assembling a matrix more
than once, e.g. for Newton, we always have to sort and dedup, even if the
sparse structure doesn't change.

This patch changes `Evaluable.assparse` such that the indices are sorted and
deduped first, and the values are then inflated using the unique indices.
# for free to join this conversation on GitHub. Already have an account? # to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@joostvanzwieten