Description of fast matrix multiplication algorithm: ⟨8×15×15:1130⟩

Algorithm type

2 X Y^{12} Z + 80 X^{4} Y^{4} Z^{4} + 14 X^{2} Y^{8} Z^{2} + 8 X^{4} Y^{3} Z^{4} + 8 X^{4} Y^{3} Z^{3} + 48 X^{2} Y^{6} Z^{2} + 16 X^{2} Y^{5} Z^{2} + 4 X^{3} Y^{4} Z + 4 X^{2} Y^{4} Z^{2} + 4 X Y^{4} Z^{3} + 8 X^{2} Y^{4} Z + 8 X Y^{4} Z^{2} + 352 X^{2} Y^{2} Z^{2} + 14 X Y^{4} Z + 20 X^{3} Y Z + 16 X^{2} Y^{2} Z + 24 X^{2} Y Z^{2} + 144 X Y^{3} Z + 8 X Y^{2} Z^{2} + 20 X Y Z^{3} + 48 X^{2} Y Z + 16 X Y^{2} Z + 48 X Y Z^{2} + 216 X Y Z

Algorithm definition

The algorithm ⟨8×15×15:1130⟩ is taken from:

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

Algorithm description

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