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

Algorithm type

16 X^{4} Y^{12} Z^{3} + 24 X^{2} Y^{12} Z^{3} + 16 X^{2} Y^{9} Z^{6} + 1152 X^{4} Y^{6} Z^{6} + 24 X Y^{9} Z^{6} + 32 X^{6} Y^{3} Z^{6} + 16 X^{8} Y^{3} Z^{3} + 32 X^{2} Y^{9} Z^{3} + 1744 X^{2} Y^{6} Z^{6} + 16 X^{4} Y^{3} Z^{6} + 48 X Y^{9} Z^{3} + 24 X Y^{6} Z^{6} + 48 X^{3} Y^{3} Z^{6} + 576 X^{2} Y^{6} Z^{3} + 168 X^{2} Y^{3} Z^{6} + 616 X^{4} Y^{3} Z^{3} + 864 X Y^{6} Z^{3} + 216 X Y^{3} Z^{6} + 1128 X^{2} Y^{3} Z^{3} + 360 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨15×30×30:7120⟩ is the (Kronecker) tensor product of ⟨5×10×5:178⟩ with ⟨3×3×6: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