Description of fast matrix multiplication algorithm: ⟨24×28×30:10780⟩

Algorithm type

96 X^{12} Y^{8} Z^{12} + 64 X^{10} Y^{8} Z^{12} + 144 X^{12} Y^{4} Z^{12} + 96 X^{10} Y^{4} Z^{12} + 64 X^{6} Y^{12} Z^{6} + 128 X^{6} Y^{8} Z^{6} + 96 X^{6} Y^{6} Z^{6} + 960 X^{6} Y^{4} Z^{6} + 12 X^{4} Y^{8} Z^{4} + 384 X^{5} Y^{4} Z^{6} + 1152 X^{6} Y^{2} Z^{6} + 576 X^{5} Y^{2} Z^{6} + 24 X^{4} Y^{4} Z^{4} + 384 X^{3} Y^{6} Z^{3} + 768 X^{3} Y^{4} Z^{3} + 24 X^{2} Y^{4} Z^{4} + 576 X^{3} Y^{3} Z^{3} + 2304 X^{3} Y^{2} Z^{3} + 96 X^{2} Y^{4} Z^{2} + 48 X^{2} Y^{2} Z^{4} + 1728 X^{3} Y Z^{3} + 192 X^{2} Y^{2} Z^{2} + 144 X Y^{2} Z^{2} + 144 X Y^{2} Z + 288 X Y Z^{2} + 288 X Y Z

Algorithm definition

The algorithm ⟨24×28×30:10780⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨12×14×15:1540⟩.

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