Description of fast matrix multiplication algorithm: ⟨4×14×16:598⟩

Algorithm type

2 X^{4} Y^{8} Z^{4} + 12 X^{4} Y^{6} Z^{4} + 16 X^{4} Y^{4} Z^{4} + 23 X^{2} Y^{8} Z^{2} + 12 X^{2} Y^{7} Z^{2} + 16 X^{2} Y^{6} Z^{2} + 32 X Y^{8} Z + 8 X^{2} Y^{5} Z^{2} + 4 X Y^{7} Z + 43 X^{2} Y^{4} Z^{2} + 20 X^{2} Y^{3} Z^{2} + 6 X Y^{5} Z + 86 X^{2} Y^{2} Z^{2} + 90 X Y^{4} Z + 56 X Y^{3} Z + 50 X Y^{2} Z + 122 X Y Z

Algorithm definition

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