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

Investigate inclusion of sparse matrices #4

Open
CerebralFart opened this issue Nov 21, 2021 · 0 comments
Open

Investigate inclusion of sparse matrices #4

CerebralFart opened this issue Nov 21, 2021 · 0 comments

Comments

@CerebralFart
Copy link
Contributor

The current implementation assumes all matrices to be dense (i.e. fully filled), but this isn't always the case. For example, in out uses, a ranking isn't defined for the majority of participant-dogroup pairs.

As such, it may be worthwhile to implement a sparse matrix format based on a non-sequential data array (Matrix#data) or even Compressed Row Storage. But the colReduce and rowReduce steps may be difficult or impossible to optimize on such a datastructure.

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