Description of fast matrix multiplication algorithm: ⟨9×18×21:1960⟩

Algorithm type

256⁢X6⁢Y9⁢Z6+384⁢X6⁢Y9⁢Z3+384⁢X3⁢Y9⁢Z6+576⁢X3⁢Y9⁢Z3+144⁢X3⁢Y3⁢Z2+216⁢X3⁢Y3⁢Z256X6Y9Z6384X6Y9Z3384X3Y9Z6576X3Y9Z3144X3Y3Z2216X3Y3Z256*X^6*Y^9*Z^6+384*X^6*Y^9*Z^3+384*X^3*Y^9*Z^6+576*X^3*Y^9*Z^3+144*X^3*Y^3*Z^2+216*X^3*Y^3*Z

Algorithm definition

The algorithm ⟨9×18×21:1960⟩ is the (Kronecker) tensor product of ⟨3×3×7:49⟩ with ⟨3×6×3:40⟩.

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