Description of fast matrix multiplication algorithm: ⟨4×4×6:73⟩

Algorithm type

2 X^{3} Y^{3} Z^{4} + X^{2} Y^{3} Z^{2} + 18 X^{2} Y^{2} Z^{2} + X Y Z^{4} + 3 X Y^{3} Z + 3 X Y^{2} Z + 45 X Y Z

Algorithm definition

The algorithm ⟨4×4×6:73⟩ is taken from:

Alexey Vladimirovich Smirnov. Bilinear algorithm <4x4x6:73> for matrix multiplication. January 2023. []

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