Description of fast matrix multiplication algorithm: ⟨3×4×11:101⟩

Algorithm type

31⁢X2⁢Y2⁢Z2+3⁢X3⁢Y⁢Z+X2⁢Y2⁢Z+2⁢X⁢Y3⁢Z+2⁢X⁢Y2⁢Z2+4⁢X⁢Y⁢Z3+3⁢X2⁢Y⁢Z+26⁢X⁢Y2⁢Z+24⁢X⁢Y⁢Z2+5⁢X⁢Y⁢Z31X2Y2Z23X3YZX2Y2Z2XY3Z2XY2Z24XYZ33X2YZ26XY2Z24XYZ25XYZ31*X^2*Y^2*Z^2+3*X^3*Y*Z+X^2*Y^2*Z+2*X*Y^3*Z+2*X*Y^2*Z^2+4*X*Y*Z^3+3*X^2*Y*Z+26*X*Y^2*Z+24*X*Y*Z^2+5*X*Y*Z

Algorithm definition

The algorithm ⟨3×4×11:101⟩ could be constructed using the following decomposition:

⟨3×4×11:101⟩ = ⟨3×4×5:47⟩ + ⟨3×4×6:54⟩.

This decomposition is defined by the following equality:

Trace⁡Mul⁡A_1_1A_1_2A_1_3A_1_4A_2_1A_2_2A_2_3A_2_4A_3_1A_3_2A_3_3A_3_4B_1_1B_1_2B_1_3B_1_4B_1_5B_1_6B_1_7B_1_8B_1_9B_1_10B_1_11B_2_1B_2_2B_2_3B_2_4B_2_5B_2_6B_2_7B_2_8B_2_9B_2_10B_2_11B_3_1B_3_2B_3_3B_3_4B_3_5B_3_6B_3_7B_3_8B_3_9B_3_10B_3_11B_4_1B_4_2B_4_3B_4_4B_4_5B_4_6B_4_7B_4_8B_4_9B_4_10B_4_11C_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_3C_11_1C_11_2C_11_3=Trace⁡Mul⁡A_1_1A_1_2A_1_3A_1_4A_2_1A_2_2A_2_3A_2_4A_3_1A_3_2A_3_3A_3_4B_1_1B_1_2B_1_3B_1_4B_1_5B_2_1B_2_2B_2_3B_2_4B_2_5B_3_1B_3_2B_3_3B_3_4B_3_5B_4_1B_4_2B_4_3B_4_4B_4_5C_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_3+Trace⁡Mul⁡A_1_1A_1_2A_1_3A_1_4A_2_1A_2_2A_2_3A_2_4A_3_1A_3_2A_3_3A_3_4B_1_6B_1_7B_1_8B_1_9B_1_10B_1_11B_2_6B_2_7B_2_8B_2_9B_2_10B_2_11B_3_6B_3_7B_3_8B_3_9B_3_10B_3_11B_4_6B_4_7B_4_8B_4_9B_4_10B_4_11C_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_3C_11_1C_11_2C_11_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