taxemeEvasion

4 ms·

1. 1.▲
   by taxemeEvasion 6y ago

   It's a main reason why Fortran still has such a hold on the SciComp/HPC community.
2. 2.▲
   by taxemeEvasion 6y ago

   Strassen's is sometimes competitive in the thousands! https://www.cs.utexas.edu/users/flame/pubs/FLAWN79.pdf You're right though afaik all the other algorithms are still 'galactic' and com
3. 3.▲
   by taxemeEvasion 6y ago

   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) y
4. 4.▲
   by taxemeEvasion 6y ago

   It's typically still the O(N^3) method that's implemented in OpenBLAS, BLIS, cuBLAS, MKL, etc. There are some high performance implementations of Strassen's Algorithm with a fixed level of recursion that start to perform much