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

Algorithm type

X^{4} Y^{6} Z^{4} + 9 X^{4} Y^{4} Z^{4} + 4 X^{4} Y^{3} Z^{4} + 2 X^{2} Y^{7} Z^{2} + 2 X^{4} Y^{2} Z^{4} + 11 X^{2} Y^{6} Z^{2} + 4 X Y^{8} Z + 10 X^{2} Y^{5} Z^{2} + 10 X Y^{7} Z + 17 X^{2} Y^{4} Z^{2} + 18 X^{2} Y^{3} Z^{2} + 10 X Y^{5} Z + 48 X^{2} Y^{2} Z^{2} + 14 X Y^{4} Z + 12 X^{2} Y Z^{2} + 62 X Y^{3} Z + 64 X Y^{2} Z + 52 X Y Z

Algorithm definition

The algorithm ⟨4×9×14:350⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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