Description of fast matrix multiplication algorithm: ⟨15×18×30:4640⟩

Algorithm type

32 X^{9} Y^{3} Z^{4} + 544 X^{6} Y^{6} Z^{4} + 32 X^{3} Y^{9} Z^{4} + 208 X^{9} Y^{3} Z^{2} + 816 X^{6} Y^{6} Z^{2} + 208 X^{3} Y^{9} Z^{2} + 64 X^{3} Y^{3} Z^{8} + 240 X^{9} Y^{3} Z + 64 X^{6} Y^{3} Z^{4} + 240 X^{3} Y^{9} Z + 64 X^{3} Y^{6} Z^{4} + 32 X^{3} Y^{3} Z^{6} + 128 X^{6} Y^{3} Z^{2} + 128 X^{3} Y^{6} Z^{2} + 48 X^{6} Y^{3} Z + 48 X^{3} Y^{6} Z + 512 X^{3} Y^{3} Z^{4} + 48 X^{3} Y^{3} Z^{3} + 848 X^{3} Y^{3} Z^{2} + 336 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨15×18×30:4640⟩ is the (Kronecker) tensor product of ⟨15×18×15:2320⟩ with ⟨1×1×2:2⟩.

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