Description of fast matrix multiplication algorithm: ⟨4×4×5:62⟩

Algorithm type

X^{4} Y^{4} Z^{4} + X^{2} Y^{3} Z^{2} + 14 X^{2} Y^{2} Z^{2} + X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + 2 X Y^{3} Z + X Y Z^{3} + 3 X^{2} Y Z + 8 X Y^{2} Z + 2 X Y Z^{2} + 27 X Y Z

Algorithm definition

The algorithm ⟨4×4×5:62⟩ 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