Description of fast matrix multiplication algorithm: ⟨4×9×16:398⟩

Algorithm type

16X4Y4Z4+16XY9Z+32X2Y6Z2+16X2Y4Z2+16XY6Z+2X2Y3Z2+80X2Y2Z2+2XY4Z+72XY3Z+58XY2Z+88XYZ16X4Y4Z416XY9Z32X2Y6Z216X2Y4Z216XY6Z2X2Y3Z280X2Y2Z22XY4Z72XY3Z58XY2Z88XYZ16*X^4*Y^4*Z^4+16*X*Y^9*Z+32*X^2*Y^6*Z^2+16*X^2*Y^4*Z^2+16*X*Y^6*Z+2*X^2*Y^3*Z^2+80*X^2*Y^2*Z^2+2*X*Y^4*Z+72*X*Y^3*Z+58*X*Y^2*Z+88*X*Y*Z

Algorithm definition

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