Description of fast matrix multiplication algorithm: ⟨11×13×16:1446⟩

Algorithm type

16 X^{4} Y^{6} Z^{4} + X^{2} Y^{4} Z^{8} + X^{2} Y^{3} Z^{8} + 58 X^{4} Y^{4} Z^{4} + 8 X^{3} Y^{6} Z^{3} + 8 X^{3} Y^{5} Z^{4} + 5 X^{2} Y^{8} Z^{2} + 18 X^{2} Y^{2} Z^{8} + 2 X^{3} Y^{5} Z^{3} + 5 X^{2} Y^{7} Z^{2} + 25 X^{4} Y^{2} Z^{4} + 14 X^{3} Y^{4} Z^{3} + 14 X^{3} Y^{3} Z^{4} + 40 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{5} Z^{3} + 12 X^{2} Y^{3} Z^{5} + 48 X^{2} Y^{2} Z^{6} + X Y^{8} Z + X^{3} Y^{3} Z^{3} + 15 X^{2} Y^{5} Z^{2} + 18 X^{2} Y^{2} Z^{5} + 6 X^{2} Y Z^{6} + X Y^{7} Z + 4 X Y^{6} Z^{2} + 4 X Y^{4} Z^{4} + 5 X^{3} Y^{2} Z^{3} + 5 X^{3} Y Z^{4} + 58 X^{2} Y^{4} Z^{2} + 3 X^{2} Y^{3} Z^{3} + 6 X^{2} Y Z^{5} + 4 X Y^{6} Z + 7 X Y^{5} Z^{2} + 2 X Y^{4} Z^{3} + 10 X Y^{3} Z^{4} + 32 X^{2} Y^{3} Z^{2} + 2 X Y^{5} Z + 7 X Y^{4} Z^{2} + 18 X Y^{3} Z^{3} + 6 X Y^{2} Z^{4} + 253 X^{2} Y^{2} Z^{2} + 37 X^{2} Y Z^{3} + 20 X Y^{4} Z + 13 X Y^{3} Z^{2} + 60 X Y^{2} Z^{3} + 44 X Y Z^{4} + 5 X^{2} Y^{2} Z + 24 X^{2} Y Z^{2} + 70 X Y^{3} Z + 14 X Y Z^{3} + 108 X^{2} Y Z + 166 X Y^{2} Z + 11 X Y Z^{2} + 129 X Y Z

Algorithm definition

The algorithm ⟨11×13×16:1446⟩ 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