Description of fast matrix multiplication algorithm: ⟨9×14×14:1101⟩

Algorithm type

2 X^{6} Y^{6} Z^{4} + 8 X^{5} Y^{6} Z^{4} + 4 X^{6} Y^{4} Z^{4} + 6 X^{4} Y^{6} Z^{4} + 16 X^{8} Y^{3} Z^{2} + 17 X^{5} Y^{4} Z^{4} + 8 X^{3} Y^{6} Z^{4} + 16 X^{8} Y^{3} Z + 17 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{8} Z^{2} + 8 X^{7} Y^{3} Z + 44 X^{6} Y^{3} Z^{2} + 2 X^{5} Y^{2} Z^{4} + 16 X^{3} Y^{6} Z^{2} + 20 X^{3} Y^{4} Z^{4} + 4 X Y^{8} Z^{2} + 40 X^{6} Y^{3} Z + 29 X^{6} Y^{2} Z^{2} + 8 X^{5} Y^{3} Z^{2} + 10 X^{4} Y^{2} Z^{4} + 28 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + 6 X^{6} Y Z^{2} + 8 X^{5} Y^{3} Z + 27 X^{5} Y^{2} Z^{2} + 14 X^{4} Y^{3} Z^{2} + 16 X^{3} Y^{4} Z^{2} + 8 X^{3} Y^{2} Z^{4} + 4 X Y^{6} Z^{2} + 4 X^{6} Y Z + 8 X^{5} Y Z^{2} + 49 X^{4} Y^{2} Z^{2} + 4 X^{3} Y^{4} Z + 20 X^{3} Y^{3} Z^{2} + 24 X^{2} Y^{4} Z^{2} + 4 X^{2} Y^{2} Z^{4} + 8 X^{5} Y Z + 16 X^{4} Y Z^{2} + 40 X^{3} Y^{3} Z + 79 X^{3} Y^{2} Z^{2} + 10 X^{2} Y^{4} Z + 8 X Y^{4} Z^{2} + 20 X^{4} Y Z + 54 X^{3} Y^{2} Z + 14 X^{3} Y Z^{2} + 48 X^{2} Y^{3} Z + 39 X^{2} Y^{2} Z^{2} + 4 X Y^{4} Z + 42 X^{3} Y Z + 80 X^{2} Y^{2} Z + 10 X^{2} Y Z^{2} + 20 X Y^{3} Z + 6 X Y^{2} Z^{2} + 56 X^{2} Y Z + 28 X Y^{2} Z + 14 X Y Z

Algorithm definition

The algorithm ⟨9×14×14:1101⟩ 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