Description of fast matrix multiplication algorithm: ⟨2 × 9 × 11:154⟩

Algorithm type

[[1, 1, 1]$88,[1, 2, 1]$18,[1, 3, 1]$12,[2, 2, 2]$40]

Algorithm definition

The algorithm ⟨2 × 9 × 11:154⟩ could be constructed using the following decomposition:

⟨2 × 9 × 11:154⟩ = ⟨2 × 9 × 2:32⟩ + ⟨2 × 9 × 9:126⟩.

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_9B_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_11B_5_1B_5_2B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_5_11B_6_1B_6_2B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_6_11B_7_1B_7_2B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_7_11B_8_1B_8_2B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_8_11B_9_1B_9_2B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10B_9_11C_1_1C_1_2C_2_1C_2_2C_3_1C_3_2C_4_1C_4_2C_5_1C_5_2C_6_1C_6_2C_7_1C_7_2C_8_1C_8_2C_9_1C_9_2C_10_1C_10_2C_11_1C_11_2=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_9B_1_1B_1_2B_2_1B_2_2B_3_1B_3_2B_4_1B_4_2B_5_1B_5_2B_6_1B_6_2B_7_1B_7_2B_8_1B_8_2B_9_1B_9_2C_1_1C_1_2C_2_1C_2_2+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_9B_1_3B_1_4B_1_5B_1_6B_1_7B_1_8B_1_9B_1_10B_1_11B_2_3B_2_4B_2_5B_2_6B_2_7B_2_8B_2_9B_2_10B_2_11B_3_3B_3_4B_3_5B_3_6B_3_7B_3_8B_3_9B_3_10B_3_11B_4_3B_4_4B_4_5B_4_6B_4_7B_4_8B_4_9B_4_10B_4_11B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_5_11B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_6_11B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_7_11B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_8_11B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10B_9_11C_3_1C_3_2C_4_1C_4_2C_5_1C_5_2C_6_1C_6_2C_7_1C_7_2C_8_1C_8_2C_9_1C_9_2C_10_1C_10_2C_11_1C_11_2TraceMulA_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_9B_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_11B_5_1B_5_2B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_5_11B_6_1B_6_2B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_6_11B_7_1B_7_2B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_7_11B_8_1B_8_2B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_8_11B_9_1B_9_2B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10B_9_11C_1_1C_1_2C_2_1C_2_2C_3_1C_3_2C_4_1C_4_2C_5_1C_5_2C_6_1C_6_2C_7_1C_7_2C_8_1C_8_2C_9_1C_9_2C_10_1C_10_2C_11_1C_11_2TraceMulA_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_9B_1_1B_1_2B_2_1B_2_2B_3_1B_3_2B_4_1B_4_2B_5_1B_5_2B_6_1B_6_2B_7_1B_7_2B_8_1B_8_2B_9_1B_9_2C_1_1C_1_2C_2_1C_2_2TraceMulA_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_9B_1_3B_1_4B_1_5B_1_6B_1_7B_1_8B_1_9B_1_10B_1_11B_2_3B_2_4B_2_5B_2_6B_2_7B_2_8B_2_9B_2_10B_2_11B_3_3B_3_4B_3_5B_3_6B_3_7B_3_8B_3_9B_3_10B_3_11B_4_3B_4_4B_4_5B_4_6B_4_7B_4_8B_4_9B_4_10B_4_11B_5_3B_5_4B_5_5B_5_6B_5_7B_5_8B_5_9B_5_10B_5_11B_6_3B_6_4B_6_5B_6_6B_6_7B_6_8B_6_9B_6_10B_6_11B_7_3B_7_4B_7_5B_7_6B_7_7B_7_8B_7_9B_7_10B_7_11B_8_3B_8_4B_8_5B_8_6B_8_7B_8_8B_8_9B_8_10B_8_11B_9_3B_9_4B_9_5B_9_6B_9_7B_9_8B_9_9B_9_10B_9_11C_3_1C_3_2C_4_1C_4_2C_5_1C_5_2C_6_1C_6_2C_7_1C_7_2C_8_1C_8_2C_9_1C_9_2C_10_1C_10_2C_11_1C_11_2Trace(Mul(Matrix(2, 9, [[A_1_1,A_1_2,A_1_3,A_1_4,A_1_5,A_1_6,A_1_7,A_1_8,A_1_9],[A_2_1,A_2_2,A_2_3,A_2_4,A_2_5,A_2_6,A_2_7,A_2_8,A_2_9]]),Matrix(9, 11, [[B_1_1,B_1_2,B_1_3,B_1_4,B_1_5,B_1_6,B_1_7,B_1_8,B_1_9,B_1_10,B_1_11],[B_2_1,B_2_2,B_2_3,B_2_4,B_2_5,B_2_6,B_2_7,B_2_8,B_2_9,B_2_10,B_2_11],[B_3_1,B_3_2,B_3_3,B_3_4,B_3_5,B_3_6,B_3_7,B_3_8,B_3_9,B_3_10,B_3_11],[B_4_1,B_4_2,B_4_3,B_4_4,B_4_5,B_4_6,B_4_7,B_4_8,B_4_9,B_4_10,B_4_11],[B_5_1,B_5_2,B_5_3,B_5_4,B_5_5,B_5_6,B_5_7,B_5_8,B_5_9,B_5_10,B_5_11],[B_6_1,B_6_2,B_6_3,B_6_4,B_6_5,B_6_6,B_6_7,B_6_8,B_6_9,B_6_10,B_6_11],[B_7_1,B_7_2,B_7_3,B_7_4,B_7_5,B_7_6,B_7_7,B_7_8,B_7_9,B_7_10,B_7_11],[B_8_1,B_8_2,B_8_3,B_8_4,B_8_5,B_8_6,B_8_7,B_8_8,B_8_9,B_8_10,B_8_11],[B_9_1,B_9_2,B_9_3,B_9_4,B_9_5,B_9_6,B_9_7,B_9_8,B_9_9,B_9_10,B_9_11]]),Matrix(11, 2, [[C_1_1,C_1_2],[C_2_1,C_2_2],[C_3_1,C_3_2],[C_4_1,C_4_2],[C_5_1,C_5_2],[C_6_1,C_6_2],[C_7_1,C_7_2],[C_8_1,C_8_2],[C_9_1,C_9_2],[C_10_1,C_10_2],[C_11_1,C_11_2]]))) = Trace(Mul(Matrix(2, 9, [[A_1_1,A_1_2,A_1_3,A_1_4,A_1_5,A_1_6,A_1_7,A_1_8,A_1_9],[A_2_1,A_2_2,A_2_3,A_2_4,A_2_5,A_2_6,A_2_7,A_2_8,A_2_9]]),Matrix(9, 2, [[B_1_1,B_1_2],[B_2_1,B_2_2],[B_3_1,B_3_2],[B_4_1,B_4_2],[B_5_1,B_5_2],[B_6_1,B_6_2],[B_7_1,B_7_2],[B_8_1,B_8_2],[B_9_1,B_9_2]]),Matrix(2, 2, [[C_1_1,C_1_2],[C_2_1,C_2_2]])))+Trace(Mul(Matrix(2, 9, [[A_1_1,A_1_2,A_1_3,A_1_4,A_1_5,A_1_6,A_1_7,A_1_8,A_1_9],[A_2_1,A_2_2,A_2_3,A_2_4,A_2_5,A_2_6,A_2_7,A_2_8,A_2_9]]),Matrix(9, 9, [[B_1_3,B_1_4,B_1_5,B_1_6,B_1_7,B_1_8,B_1_9,B_1_10,B_1_11],[B_2_3,B_2_4,B_2_5,B_2_6,B_2_7,B_2_8,B_2_9,B_2_10,B_2_11],[B_3_3,B_3_4,B_3_5,B_3_6,B_3_7,B_3_8,B_3_9,B_3_10,B_3_11],[B_4_3,B_4_4,B_4_5,B_4_6,B_4_7,B_4_8,B_4_9,B_4_10,B_4_11],[B_5_3,B_5_4,B_5_5,B_5_6,B_5_7,B_5_8,B_5_9,B_5_10,B_5_11],[B_6_3,B_6_4,B_6_5,B_6_6,B_6_7,B_6_8,B_6_9,B_6_10,B_6_11],[B_7_3,B_7_4,B_7_5,B_7_6,B_7_7,B_7_8,B_7_9,B_7_10,B_7_11],[B_8_3,B_8_4,B_8_5,B_8_6,B_8_7,B_8_8,B_8_9,B_8_10,B_8_11],[B_9_3,B_9_4,B_9_5,B_9_6,B_9_7,B_9_8,B_9_9,B_9_10,B_9_11]]),Matrix(9, 2, [[C_3_1,C_3_2],[C_4_1,C_4_2],[C_5_1,C_5_2],[C_6_1,C_6_2],[C_7_1,C_7_2],[C_8_1,C_8_2],[C_9_1,C_9_2],[C_10_1,C_10_2],[C_11_1,C_11_2]])))

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