Description of fast matrix multiplication algorithm: ⟨4×9×11:275⟩

Algorithm type

5 X^{4} Y^{5} Z^{4} + 5 X^{4} Y^{4} Z^{4} + 2 X^{4} Y^{3} Z^{4} + X^{2} Y^{6} Z^{2} + 19 X^{2} Y^{5} Z^{2} + 28 X^{2} Y^{4} Z^{2} + 8 X Y^{6} Z + 23 X^{2} Y^{3} Z^{2} + 28 X Y^{5} Z + 16 X^{2} Y^{2} Z^{2} + 17 X Y^{4} Z + X Y^{3} Z^{2} + 5 X^{2} Y Z^{2} + 50 X Y^{3} Z + 36 X Y^{2} Z + X Y Z^{2} + 30 X Y Z

Algorithm definition

The algorithm ⟨4×9×11:275⟩ 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