Description of fast matrix multiplication algorithm: ⟨18×18×28:5055⟩

Algorithm type

48 X^{8} Y^{12} Z^{12} + 72 X^{4} Y^{12} Z^{12} + 96 X^{8} Y^{6} Z^{6} + 528 X^{4} Y^{6} Z^{6} + 576 X^{2} Y^{6} Z^{6} + 45 X^{4} Y^{4} Z^{4} + 18 X^{6} Y^{2} Z^{2} + 576 X^{4} Y^{3} Z^{3} + 36 X^{6} Y Z + 126 X^{4} Y^{2} Z^{2} + 1440 X^{2} Y^{3} Z^{3} + 864 X Y^{3} Z^{3} + 72 X^{4} Y Z + 162 X^{2} Y^{2} Z^{2} + 36 X^{3} Y Z + 216 X^{2} Y Z + 144 X Y Z

Algorithm definition

The algorithm ⟨18×18×28:5055⟩ is the (Kronecker) tensor product of ⟨3×3×2:15⟩ with ⟨6×6×14:337⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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