Description of fast matrix multiplication algorithm: ⟨8×10×14:726⟩

Algorithm type

36 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z^{2} + X^{2} Y^{4} Z^{4} + 7 X^{4} Y^{2} Z^{2} + 15 X^{2} Y^{4} Z^{2} + 14 X^{2} Y^{2} Z^{4} + 2 X^{2} Y^{2} Z^{3} + 245 X^{2} Y^{2} Z^{2} + 12 X Y^{3} Z + 6 X Y^{2} Z^{2} + 7 X Y Z^{3} + 42 X^{2} Y Z + 90 X Y^{2} Z + 90 X Y Z^{2} + 157 X Y Z

Algorithm definition

The algorithm ⟨8×10×14:726⟩ 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