Description of fast matrix multiplication algorithm: ⟨5×9×15:468⟩

Algorithm type

18 X^{4} Y^{4} Z^{4} + 6 X^{3} Y^{4} Z^{3} + 12 X^{2} Y^{4} Z^{3} + 30 X^{2} Y^{4} Z^{2} + 9 X^{2} Y^{2} Z^{4} + 2 X^{2} Y^{4} Z + 24 X^{2} Y^{2} Z^{3} + 2 X Y^{4} Z^{2} + 66 X^{2} Y^{2} Z^{2} + 2 X Y^{4} Z + 6 X Y^{2} Z^{3} + 2 X^{2} Y^{2} Z + 36 X Y^{2} Z^{2} + 33 X Y Z^{3} + 112 X Y^{2} Z + 52 X Y Z^{2} + 56 X Y Z

Algorithm definition

The algorithm ⟨5×9×15:468⟩ 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