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

Algorithm type

48 X^{4} Y^{6} Z^{6} + 72 X^{2} Y^{6} Z^{6} + 3 X^{4} Y^{4} Z^{4} + 16 X^{2} Y^{5} Z^{3} + 32 X^{2} Y^{3} Z^{5} + 24 X Y^{5} Z^{3} + 40 X Y^{3} Z^{5} + 12 X^{4} Y^{2} Z^{2} + 144 X^{2} Y^{3} Z^{3} + 8 X Y^{3} Z^{4} + 216 X Y^{3} Z^{3} + 12 X^{4} Y Z + 21 X^{2} Y^{2} Z^{2} + 42 X^{2} Y Z + 30 X Y Z

Algorithm definition

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