Description of fast matrix multiplication algorithm: ⟨14×15×15:1890⟩

Algorithm type

16 X^{6} Y^{2} Z^{5} + 24 X^{6} Y Z^{5} + 144 X^{4} Y^{4} Z^{4} + X^{2} Y^{2} Z^{5} + 45 X^{4} Y^{2} Z^{2} + 318 X^{2} Y^{4} Z^{2} + 47 X^{2} Y^{2} Z^{4} + 18 X^{2} Y^{2} Z^{3} + X^{2} Y Z^{4} + X Y Z^{5} + 2 X^{3} Y Z^{2} + 9 X^{2} Y^{3} Z + 385 X^{2} Y^{2} Z^{2} + 3 X^{2} Y Z^{3} + 60 X Y^{4} Z + 2 X Y Z^{4} + 18 X^{3} Y Z + 90 X^{2} Y^{2} Z + 33 X^{2} Y Z^{2} + X Y^{3} Z + 90 X Y^{2} Z^{2} + 24 X Y Z^{3} + 122 X^{2} Y Z + 156 X Y^{2} Z + 149 X Y Z^{2} + 131 X Y Z

Algorithm definition

The algorithm ⟨14×15×15:1890⟩ 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