Re:Matrix multiplication inches closer to mythic goal
by taxemeEvasion on Tuesday March 23, 2021 @11:51AM
(#26556466)
I think its also important to mention that these results are for the multiplication of two general dense matrices and full floating point accuracy. If your matrix is structured (sparse, sparse in the Fourier domain, low rank, H, HSS, etc) you can usually exploit that structure to break up the multiplication and reduce the work complexity dramatically. (These rely on building blocks of the dense general matrix results)
[ Parent
| on HN ]
There are no comments on this comment yet.