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

Algorithm type

32 X^{6} Y^{6} Z^{6} + 384 X^{6} Y^{6} Z^{4} + 48 X^{6} Y^{6} Z^{3} + 32 X^{9} Y^{3} Z^{2} + 576 X^{6} Y^{6} Z^{2} + 112 X^{3} Y^{9} Z^{2} + 32 X^{3} Y^{3} Z^{8} + 48 X^{9} Y^{3} Z + 168 X^{3} Y^{9} Z + 96 X^{3} Y^{6} Z^{4} + 64 X^{3} Y^{3} Z^{6} + 32 X^{6} Y^{3} Z^{2} + 336 X^{3} Y^{6} Z^{2} + 48 X^{6} Y^{3} Z + 288 X^{3} Y^{6} Z + 272 X^{3} Y^{3} Z^{4} + 96 X^{3} Y^{3} Z^{3} + 400 X^{3} Y^{3} Z^{2} + 96 X^{3} Y^{3} Z

Algorithm definition

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