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

Algorithm type

2 X^{4} Y^{8} Z^{4} + 2 X^{4} Y^{6} Z^{5} + 4 X^{4} Y^{6} Z^{4} + 16 X^{4} Y^{4} Z^{5} + 69 X^{4} Y^{4} Z^{4} + 10 X^{2} Y^{8} Z^{2} + 4 X^{6} Y^{2} Z^{3} + 4 X^{4} Y^{4} Z^{3} + 4 X^{2} Y^{6} Z^{3} + 3 X^{2} Y^{3} Z^{6} + 8 X^{6} Y^{2} Z^{2} + 14 X^{4} Y^{4} Z^{2} + 17 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{3} Z^{5} + 62 X^{2} Y^{2} Z^{6} + 4 X Y Z^{8} + 8 X^{4} Y^{2} Z^{3} + 10 X^{2} Y^{4} Z^{3} + 3 X^{2} Y^{3} Z^{4} + 36 X^{2} Y^{2} Z^{5} + 4 X Y Z^{7} + 29 X^{4} Y^{2} Z^{2} + 42 X^{2} Y^{4} Z^{2} + 3 X^{2} Y^{3} Z^{3} + 72 X^{2} Y^{2} Z^{4} + 8 X Y^{4} Z^{3} + 14 X^{3} Y Z^{3} + 5 X^{2} Y^{3} Z^{2} + 145 X^{2} Y^{2} Z^{3} + 6 X Y^{4} Z^{2} + 12 X Y^{3} Z^{3} + 3 X Y Z^{5} + 3 X^{3} Y Z^{2} + 146 X^{2} Y^{2} Z^{2} + 55 X^{2} Y Z^{3} + 2 X Y^{4} Z + 10 X Y^{3} Z^{2} + 58 X Y^{2} Z^{3} + 19 X Y Z^{4} + 15 X^{3} Y Z + 20 X^{2} Y^{2} Z + 46 X^{2} Y Z^{2} + 10 X Y^{3} Z + 69 X Y^{2} Z^{2} + 66 X Y Z^{3} + 59 X^{2} Y Z + 57 X Y^{2} Z + 103 X Y Z^{2} + 69 X Y Z

Algorithm definition

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