Description of fast matrix multiplication algorithm: ⟨8×16×16:1230⟩

Algorithm type

28 X^{4} Y^{8} Z^{4} + 48 X^{4} Y^{6} Z^{4} + 2 X^{6} Y^{4} Z^{2} + 26 X^{4} Y^{4} Z^{4} + 66 X^{2} Y^{8} Z^{2} + 34 X^{2} Y^{7} Z^{2} + 8 X^{4} Y^{4} Z^{2} + 36 X^{2} Y^{6} Z^{2} + 28 X^{2} Y^{5} Z^{2} + 4 X^{3} Y^{4} Z + 146 X^{2} Y^{4} Z^{2} + 16 X^{2} Y^{4} Z + 192 X^{2} Y^{2} Z^{2} + 224 X Y^{4} Z + 92 X Y^{3} Z + 280 X Y Z

Algorithm definition

The algorithm ⟨8×16×16:1230⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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