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

Algorithm type

16 X^{2} Y^{9} Z^{6} + 512 X^{4} Y^{6} Z^{6} + 16 X^{4} Y^{3} Z^{9} + 24 X Y^{9} Z^{6} + 16 X^{6} Y^{6} Z^{3} + 784 X^{2} Y^{6} Z^{6} + 24 X^{2} Y^{3} Z^{9} + 16 X^{4} Y^{6} Z^{3} + 16 X^{4} Y^{3} Z^{6} + 24 X Y^{6} Z^{6} + 24 X^{3} Y^{6} Z^{3} + 200 X^{2} Y^{6} Z^{3} + 200 X^{2} Y^{3} Z^{6} + 176 X^{4} Y^{3} Z^{3} + 264 X Y^{6} Z^{3} + 264 X Y^{3} Z^{6} + 616 X^{2} Y^{3} Z^{3} + 528 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨15×15×30:3720⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨5×5×5:93⟩.

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