Description of fast matrix multiplication algorithm: ⟨15×18×21:3280⟩

Algorithm type

16 X^{6} Y^{6} Z^{10} + 64 X^{6} Y^{6} Z^{8} + 32 X^{6} Y^{6} Z^{6} + 24 X^{6} Y^{6} Z^{5} + 16 X^{3} Y^{6} Z^{8} + 352 X^{6} Y^{6} Z^{4} + 32 X^{3} Y^{3} Z^{10} + 48 X^{6} Y^{6} Z^{3} + 64 X^{3} Y^{6} Z^{6} + 416 X^{6} Y^{6} Z^{2} + 64 X^{3} Y^{3} Z^{8} + 48 X^{6} Y^{6} Z + 40 X^{3} Y^{6} Z^{4} + 96 X^{3} Y^{6} Z^{3} + 32 X^{3} Y^{3} Z^{6} + 32 X^{6} Y^{3} Z^{2} + 40 X^{3} Y^{6} Z^{2} + 48 X^{3} Y^{3} Z^{5} + 48 X^{6} Y^{3} Z + 24 X^{3} Y^{6} Z + 272 X^{3} Y^{3} Z^{4} + 48 X^{3} Y^{3} Z^{3} + 728 X^{3} Y^{3} Z^{2} + 696 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨15×18×21:3280⟩ is the (Kronecker) tensor product of ⟨5×3×7:82⟩ 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