Description of fast matrix multiplication algorithm: 〈2×2×2:7〉
The algorithm 〈2×2×2:7〉 is taken from:
|Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354--356, August 1969. [DOI]|
Algorithm symmetriesThe following group of 36 isotropies acts as a permutation group on algorithm tensor representation:
These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.
Back to main table