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

Algorithm type

32 X^{2} Y^{12} Z^{3} + 16 X^{2} Y^{6} Z^{9} + 272 X^{4} Y^{6} Z^{6} + 48 X Y^{12} Z^{3} + 24 X Y^{6} Z^{9} + 16 X^{6} Y^{6} Z^{3} + 16 X^{2} Y^{9} Z^{3} + 440 X^{2} Y^{6} Z^{6} + 80 X^{2} Y^{3} Z^{9} + 32 X^{4} Y^{6} Z^{3} + 24 X Y^{9} Z^{3} + 48 X Y^{6} Z^{6} + 120 X Y^{3} Z^{9} + 80 X^{6} Y^{3} Z^{3} + 24 X^{3} Y^{6} Z^{3} + 256 X^{2} Y^{6} Z^{3} + 16 X^{2} Y^{3} Z^{6} + 16 X^{4} Y^{3} Z^{3} + 312 X Y^{6} Z^{3} + 24 X Y^{3} Z^{6} + 120 X^{3} Y^{3} Z^{3} + 136 X^{2} Y^{3} Z^{3} + 168 X Y^{3} Z^{3}

Algorithm definition

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

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