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

Algorithm type

4 X Y^{15} Z + 12 X^{4} Y^{6} Z^{4} + 4 X^{2} Y^{10} Z^{2} + 28 X Y^{12} Z + 12 X^{2} Y^{9} Z^{2} + 56 X^{4} Y^{4} Z^{4} + 28 X^{2} Y^{8} Z^{2} + 24 X Y^{9} Z + 80 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{5} Z^{2} + 4 X Y^{7} Z + 48 X^{2} Y^{4} Z^{2} + 48 X Y^{6} Z + 28 X^{2} Y^{3} Z^{2} + 16 X Y^{5} Z + 268 X^{2} Y^{2} Z^{2} + 64 X Y^{4} Z + 188 X Y^{3} Z + 108 X Y^{2} Z + 308 X Y Z

Algorithm definition

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