Description of fast matrix multiplication algorithm: ⟨4×13×16:560⟩

Algorithm type

6 X^{4} Y^{6} Z^{4} + 4 X^{4} Y^{5} Z^{4} + 14 X^{4} Y^{4} Z^{4} + 9 X^{2} Y^{8} Z^{2} + 4 X Y^{10} Z + 10 X^{2} Y^{7} Z^{2} + 6 X Y^{9} Z + 20 X^{2} Y^{6} Z^{2} + 5 X Y^{8} Z + 28 X^{2} Y^{5} Z^{2} + 13 X Y^{7} Z + 61 X^{2} Y^{4} Z^{2} + 17 X Y^{6} Z + X^{2} Y^{4} Z + 7 X^{2} Y^{3} Z^{2} + 32 X Y^{5} Z + X Y^{4} Z^{2} + 64 X^{2} Y^{2} Z^{2} + 103 X Y^{4} Z + 3 X^{2} Y Z^{2} + 35 X Y^{3} Z + 27 X Y^{2} Z + 90 X Y Z

Algorithm definition

The algorithm ⟨4×13×16:560⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

Algorithm description

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