Description of fast matrix multiplication algorithm: ⟨3×5×9:102⟩

Algorithm type

3⁢X2⁢Y3⁢Z2+X2⁢Y2⁢Z3+29⁢X2⁢Y2⁢Z2+6⁢X⁢Y3⁢Z+6⁢X⁢Y2⁢Z2+8⁢X⁢Y⁢Z3+2⁢X2⁢Y⁢Z+21⁢X⁢Y2⁢Z+14⁢X⁢Y⁢Z2+12⁢X⁢Y⁢Z3X2Y3Z2X2Y2Z329X2Y2Z26XY3Z6XY2Z28XYZ32X2YZ21XY2Z14XYZ212XYZ3*X^2*Y^3*Z^2+X^2*Y^2*Z^3+29*X^2*Y^2*Z^2+6*X*Y^3*Z+6*X*Y^2*Z^2+8*X*Y*Z^3+2*X^2*Y*Z+21*X*Y^2*Z+14*X*Y*Z^2+12*X*Y*Z

Algorithm definition

The algorithm ⟨3×5×9:102⟩ 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