Description of fast matrix multiplication algorithm: ⟨11×12×18:1476⟩

Algorithm type

24 X^{6} Y^{6} Z^{6} + 80 X^{6} Y^{6} Z^{5} + 24 X^{6} Y^{6} Z^{4} + 136 X^{6} Y^{6} Z^{3} + 56 X^{6} Y^{6} Z^{2} + 32 X^{3} Y^{3} Z^{6} + 88 X^{3} Y^{3} Z^{5} + 32 X^{3} Y^{3} Z^{4} + 10 X^{2} Y^{2} Z^{6} + 176 X^{3} Y^{3} Z^{3} + 62 X^{2} Y^{2} Z^{5} + 56 X^{3} Y^{3} Z^{2} + 102 X^{2} Y^{2} Z^{4} + 16 X^{3} Y^{3} Z + 62 X^{2} Y^{2} Z^{3} + 16 X^{2} Y^{2} Z^{2} + 108 X^{2} Y Z^{3} + 108 X Y^{2} Z^{3} + 88 X^{2} Y Z^{2} + 88 X Y^{2} Z^{2} + 56 X^{2} Y Z + 56 X Y^{2} Z

Algorithm definition

The algorithm ⟨11×12×18:1476⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨11×12×9:738⟩.

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