Description of fast matrix multiplication algorithm: ⟨3×9×10:203⟩

Algorithm type

32⁢X3⁢Y3⁢Z2+16⁢X2⁢Y3⁢Z3+48⁢X3⁢Y3⁢Z+24⁢X⁢Y3⁢Z3+25⁢X2⁢Y2⁢Z2+X3⁢Y⁢Z+2⁢X⁢Y3⁢Z+2⁢X⁢Y2⁢Z2+2⁢X⁢Y⁢Z3+18⁢X2⁢Y⁢Z+22⁢X⁢Y2⁢Z+4⁢X⁢Y⁢Z2+7⁢X⁢Y⁢Z32X3Y3Z216X2Y3Z348X3Y3Z24XY3Z325X2Y2Z2X3YZ2XY3Z2XY2Z22XYZ318X2YZ22XY2Z4XYZ27XYZ32*X^3*Y^3*Z^2+16*X^2*Y^3*Z^3+48*X^3*Y^3*Z+24*X*Y^3*Z^3+25*X^2*Y^2*Z^2+X^3*Y*Z+2*X*Y^3*Z+2*X*Y^2*Z^2+2*X*Y*Z^3+18*X^2*Y*Z+22*X*Y^2*Z+4*X*Y*Z^2+7*X*Y*Z

Algorithm definition

The algorithm ⟨3×9×10:203⟩ could be constructed using the following decomposition:

⟨3×9×10:203⟩ = ⟨3×3×10:69⟩ + ⟨3×6×10:134⟩.

This decomposition is defined by the following equality:

Trace⁡Mul⁡A_1_1A_1_2A_1_3A_1_4A_1_5A_1_6A_1_7A_1_8A_1_9A_2_1A_2_2A_2_3A_2_4A_2_5A_2_6A_2_7A_2_8A_2_9A_3_1A_3_2A_3_3A_3_4A_3_5A_3_6A_3_7A_3_8A_3_9B_1_1B_1_2B_1_3B_1_4B_1_5B_1_6B_1_7B_1_8B_1_9B_1_10B_2_1B_2_2B_2_3B_2_4B_2_5B_2_6B_2_7B_2_8B_2_9B_2_10B_3_1B_3_2B_3_3B_3_4B_3_5B_3_6B_3_7B_3_8B_3_9B_3_10B_4_1B_4_2B_4_3B_4_4B_4_5B_4_6B_4_7B_4_8B_4_9B_4_10B_5_1B_5_2B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_6_1B_6_2B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_7_1B_7_2B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_8_1B_8_2B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_9_1B_9_2B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10C_1_1C_1_2C_1_3C_2_1C_2_2C_2_3C_3_1C_3_2C_3_3C_4_1C_4_2C_4_3C_5_1C_5_2C_5_3C_6_1C_6_2C_6_3C_7_1C_7_2C_7_3C_8_1C_8_2C_8_3C_9_1C_9_2C_9_3C_10_1C_10_2C_10_3=Trace⁡Mul⁡A_1_1A_1_2A_1_3A_2_1A_2_2A_2_3A_3_1A_3_2A_3_3B_1_1B_1_2B_1_3B_1_4B_1_5B_1_6B_1_7B_1_8B_1_9B_1_10B_2_1B_2_2B_2_3B_2_4B_2_5B_2_6B_2_7B_2_8B_2_9B_2_10B_3_1B_3_2B_3_3B_3_4B_3_5B_3_6B_3_7B_3_8B_3_9B_3_10C_1_1C_1_2C_1_3C_2_1C_2_2C_2_3C_3_1C_3_2C_3_3C_4_1C_4_2C_4_3C_5_1C_5_2C_5_3C_6_1C_6_2C_6_3C_7_1C_7_2C_7_3C_8_1C_8_2C_8_3C_9_1C_9_2C_9_3C_10_1C_10_2C_10_3+Trace⁡Mul⁡A_1_4A_1_5A_1_6A_1_7A_1_8A_1_9A_2_4A_2_5A_2_6A_2_7A_2_8A_2_9A_3_4A_3_5A_3_6A_3_7A_3_8A_3_9B_4_1B_4_2B_4_3B_4_4B_4_5B_4_6B_4_7B_4_8B_4_9B_4_10B_5_1B_5_2B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_6_1B_6_2B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_7_1B_7_2B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_8_1B_8_2B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_9_1B_9_2B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10C_1_1C_1_2C_1_3C_2_1C_2_2C_2_3C_3_1C_3_2C_3_3C_4_1C_4_2C_4_3C_5_1C_5_2C_5_3C_6_1C_6_2C_6_3C_7_1C_7_2C_7_3C_8_1C_8_2C_8_3C_9_1C_9_2C_9_3C_10_1C_10_2C_10_3

N.B.: for any matrices A, B and C such that the expression Tr(Mul(A,B,C)) is defined, one can construct several trilinear homogeneous polynomials P(A,B,C) such that P(A,B,C)=Tr(Mul(A,B,C)) (P(A,B,C) variables are A,B and C's coefficients). Each trilinear P expression encodes a matrix multiplication algorithm: the coefficient in C_i_j of P(A,B,C) is the (i,j)-th entry of the matrix product Mul(A,B)=Transpose(C).

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