Description of fast matrix multiplication algorithm: ⟨6×15×28:1576⟩

Algorithm type

32 X^{2} Y^{12} Z^{3} + 160 X^{4} Y^{6} Z^{6} + 48 X Y^{12} Z^{3} + 240 X^{2} Y^{6} Z^{6} + 160 X^{2} Y^{6} Z^{3} + 240 X Y^{6} Z^{3} + 18 X^{2} Y^{4} Z^{2} + 192 X^{2} Y^{3} Z^{3} + 288 X Y^{3} Z^{3} + 36 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 4 X Y^{2} Z^{3} + 12 X Y^{2} Z^{2} + 8 X Y Z^{3} + 50 X Y^{2} Z + 24 X Y Z^{2} + 52 X Y Z

Algorithm definition

The algorithm ⟨6×15×28:1576⟩ is the projection [[0, 0], [29]] of ⟨6×15×29:1576⟩.

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