Description of fast matrix multiplication algorithm: ⟨12×21×21:3040⟩

Algorithm type

32 X^{6} Y^{12} Z^{6} + 64 X^{6} Y^{10} Z^{6} + 64 X^{6} Y^{8} Z^{6} + 48 X^{3} Y^{14} Z^{3} + 96 X^{6} Y^{6} Z^{6} + 16 X^{3} Y^{12} Z^{3} + 96 X^{6} Y^{5} Z^{6} + 240 X^{6} Y^{4} Z^{6} + 272 X^{3} Y^{10} Z^{3} + 72 X^{6} Y^{3} Z^{6} + 232 X^{6} Y^{2} Z^{6} + 96 X^{3} Y^{8} Z^{3} + 24 X^{6} Y Z^{6} + 72 X^{3} Y^{7} Z^{3} + 168 X^{3} Y^{6} Z^{3} + 408 X^{3} Y^{5} Z^{3} + 224 X^{3} Y^{4} Z^{3} + 216 X^{3} Y^{3} Z^{3} + 312 X^{3} Y^{2} Z^{3} + 288 X^{3} Y Z^{3}

Algorithm definition

The algorithm ⟨12×21×21:3040⟩ is the (Kronecker) tensor product of ⟨2×7×7:76⟩ with ⟨6×3×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