Description of fast matrix multiplication algorithm: ⟨4×10×15:413⟩

Algorithm type

5 X^{4} Y^{5} Z^{4} + 10 X^{4} Y^{4} Z^{4} + 20 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{5} Z^{2} + 3 X Y^{7} Z + 36 X^{2} Y^{4} Z^{2} + X^{2} Y^{2} Z^{4} + 16 X Y^{6} Z + X Y^{5} Z^{2} + 25 X^{2} Y^{3} Z^{2} + 13 X Y^{5} Z + 48 X^{2} Y^{2} Z^{2} + 32 X Y^{4} Z + X Y^{3} Z^{2} + 44 X Y^{3} Z + 92 X Y^{2} Z + 2 X Y Z^{2} + 52 X Y Z

Algorithm definition

The algorithm ⟨4×10×15:413⟩ 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