Description of fast matrix multiplication algorithm: ⟨4×15×16:632⟩

Algorithm type

32 X^{4} Y^{8} Z^{4} + X^{2} Y^{9} Z^{2} + 69 X^{2} Y^{8} Z^{2} + X^{2} Y^{7} Z^{2} + 6 X Y^{9} Z + 2 X^{2} Y^{6} Z^{2} + 39 X Y^{8} Z + 9 X^{2} Y^{5} Z^{2} + 10 X Y^{7} Z + 29 X^{2} Y^{4} Z^{2} + 17 X Y^{6} Z + 41 X^{2} Y^{3} Z^{2} + 30 X Y^{5} Z + 80 X^{2} Y^{2} Z^{2} + 22 X Y^{4} Z + 107 X Y^{3} Z + 44 X Y^{2} Z + 93 X Y Z

Algorithm definition

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