Description of fast matrix multiplication algorithm: ⟨9×18×30:2720⟩

Algorithm type

32 X^{4} Y^{9} Z^{6} + 32 X^{2} Y^{12} Z^{3} + 48 X^{2} Y^{9} Z^{6} + 288 X^{4} Y^{6} Z^{6} + 32 X^{4} Y^{3} Z^{9} + 48 X Y^{12} Z^{3} + 48 X^{6} Y^{6} Z^{3} + 32 X^{6} Y^{3} Z^{6} + 80 X^{2} Y^{9} Z^{3} + 496 X^{2} Y^{6} Z^{6} + 144 X^{2} Y^{3} Z^{9} + 120 X Y^{9} Z^{3} + 96 X Y^{6} Z^{6} + 144 X Y^{3} Z^{9} + 64 X^{6} Y^{3} Z^{3} + 72 X^{3} Y^{6} Z^{3} + 48 X^{3} Y^{3} Z^{6} + 128 X^{2} Y^{6} Z^{3} + 128 X^{2} Y^{3} Z^{6} + 192 X Y^{6} Z^{3} + 192 X Y^{3} Z^{6} + 96 X^{3} Y^{3} Z^{3} + 64 X^{2} Y^{3} Z^{3} + 96 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×18×30:2720⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨3×6×5:68⟩.

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