Description of fast matrix multiplication algorithm: ⟨12×12×30:2440⟩

Algorithm type

16 X^{2} Y^{6} Z^{12} + 16 X^{4} Y^{6} Z^{9} + 24 X Y^{6} Z^{12} + 96 X^{6} Y^{6} Z^{6} + 40 X^{2} Y^{6} Z^{9} + 144 X^{4} Y^{6} Z^{6} + 32 X^{4} Y^{3} Z^{9} + 24 X Y^{6} Z^{9} + 32 X^{6} Y^{6} Z^{3} + 144 X^{3} Y^{6} Z^{6} + 32 X^{2} Y^{9} Z^{3} + 280 X^{2} Y^{6} Z^{6} + 48 X^{2} Y^{3} Z^{9} + 64 X^{4} Y^{3} Z^{6} + 48 X Y^{9} Z^{3} + 96 X Y^{6} Z^{6} + 128 X^{6} Y^{3} Z^{3} + 48 X^{3} Y^{6} Z^{3} + 32 X^{2} Y^{6} Z^{3} + 96 X^{2} Y^{3} Z^{6} + 160 X^{4} Y^{3} Z^{3} + 48 X Y^{6} Z^{3} + 192 X^{3} Y^{3} Z^{3} + 384 X^{2} Y^{3} Z^{3} + 216 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨12×12×30:2440⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨4×4×5:61⟩.

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