Speed up matrix multiply
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 15
- Forks
- 2
- PR merge metrics
- No merged PRs in 30d
Description
Right now our Numba matrix multiply code is decent, but its asymptotic performance is worse than either SciPy or MKL. It's fine to get us started, but it would be nice to implement a more performant algorithm.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by locating the repository's Numba matrix multiplication implementation and reviewing how it currently handles sparse matrices. Compare its asymptotic behavior with SciPy and MKL, then determine and document what a more performant algorithm would need to achieve; the issue does not name files, tests, or a concrete completion criterion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data, performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100