Idea: implement a faster Cholesky, LU and QR decomposition
Open
- Dominant language
- Rust
- Stars
- 4.8k
- Forks
- 565
- PR merge metrics
- No merged PRs in 30d
Description
A pre-print paper of December 2018 proposes a faster Cholesky, LU and QR decomposition: https://arxiv.org/pdf/1812.02056.pdf . Note that it finds the fastest improvements when using the [Strassen algorithm](https://en.wikipedia.org/wiki/Strassen_algorithm) for matrix multiplications. I do not know whether nalgebra current uses that algorithm.
Abstract
Performance
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.