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

Algorithm type

3 X^{6} Y^{6} Z^{4} + 9 X^{5} Y^{6} Z^{4} + 7 X^{6} Y^{4} Z^{4} + 6 X^{4} Y^{6} Z^{4} + 23 X^{5} Y^{4} Z^{4} + 2 X^{3} Y^{8} Z^{2} + X^{3} Y^{6} Z^{4} + 2 X^{6} Y^{2} Z^{4} + 4 X^{4} Y^{6} Z^{2} + 23 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{8} Z^{2} + 3 X^{2} Y^{6} Z^{4} + 4 X^{6} Y^{3} Z^{2} + 10 X^{5} Y^{2} Z^{4} + 28 X^{3} Y^{6} Z^{2} + 4 X^{3} Y^{4} Z^{4} + 5 X^{3} Y^{2} Z^{6} + 2 X Y^{6} Z^{4} + X^{8} Y Z + 17 X^{6} Y^{2} Z^{2} + 35 X^{5} Y^{3} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 8 X^{2} Y^{6} Z^{2} + 5 X^{2} Y^{2} Z^{6} + X^{7} Y Z + 2 X^{6} Y Z^{2} + 95 X^{5} Y^{2} Z^{2} + 16 X^{4} Y^{3} Z^{2} + 36 X^{3} Y^{4} Z^{2} + 2 X^{3} Y^{2} Z^{4} + 6 X Y^{6} Z^{2} + X^{6} Y Z + 16 X^{5} Y Z^{2} + 59 X^{4} Y^{2} Z^{2} + 8 X^{3} Y^{4} Z + 9 X^{3} Y^{3} Z^{2} + 2 X^{2} Y^{2} Z^{4} + X^{5} Y Z + 26 X^{4} Y Z^{2} + 82 X^{3} Y^{3} Z + 57 X^{3} Y^{2} Z^{2} + 5 X^{3} Y Z^{3} + 11 X^{2} Y^{4} Z + 120 X^{3} Y^{2} Z + 25 X^{3} Y Z^{2} + 34 X^{2} Y^{3} Z + 12 X^{2} Y^{2} Z^{2} + 2 X^{2} Y Z^{3} + 5 X Y^{4} Z + 80 X^{3} Y Z + 27 X^{2} Y^{2} Z + 13 X^{2} Y Z^{2} + 12 X Y^{3} Z + 7 X Y^{2} Z^{2} + X Y Z^{3} + 27 X^{2} Y Z + 3 X Y^{2} Z + 2 X Y Z^{2} + 9 X Y Z

Algorithm definition

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