Description of fast matrix multiplication algorithm: ⟨5×5×5:97⟩

Algorithm type

X^{3} Y^{4} Z^{4} + 3 X^{3} Y^{2} Z^{2} + X^{2} Y^{3} Z^{2} + 2 X^{2} Y^{2} Z^{3} + 20 X^{2} Y^{2} Z^{2} + X^{3} Y Z + 2 X^{2} Y^{2} Z + X^{2} Y Z^{2} + X Y^{3} Z + X Y Z^{3} + 7 X^{2} Y Z + X Y^{2} Z + 12 X Y Z^{2} + 44 X Y Z

Algorithm definition

The algorithm ⟨5×5×5:97⟩ is taken from:

Manuel Kauers and Jakob Moosbauer. Flip graphs for matrix multiplication. Technical report, arXiv, December 2022. [ arXiv ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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