Description of fast matrix multiplication algorithm: ⟨5×8×28:774⟩

Algorithm type

12 X^{4} Y^{4} Z^{4} + 12 X^{3} Y^{6} Z^{3} + 2 X^{2} Y^{8} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 18 X^{3} Y^{4} Z^{3} + 12 X^{2} Y^{6} Z^{2} + 2 X Y^{8} Z + 6 X^{2} Y^{6} Z + 6 X^{3} Y^{2} Z^{3} + 24 X^{2} Y^{4} Z^{2} + 6 X Y^{6} Z + 6 X^{2} Y^{4} Z + 42 X^{2} Y^{3} Z^{2} + 158 X^{2} Y^{2} Z^{2} + 36 X Y^{4} Z + 36 X^{2} Y Z^{2} + 108 X Y^{3} Z + 6 X Y^{2} Z^{2} + 84 X Y^{2} Z + 192 X Y Z

Algorithm definition

The algorithm ⟨5×8×28:774⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨5×8×14:387⟩.

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