Description of fast matrix multiplication algorithm: ⟨12×17×18:2160⟩

Algorithm type

208 X^{4} Y^{6} Z^{6} + 80 X^{4} Y^{5} Z^{6} + 312 X^{2} Y^{6} Z^{6} + 120 X^{2} Y^{5} Z^{6} + 224 X^{2} Y^{6} Z^{3} + 256 X^{4} Y^{3} Z^{3} + 64 X^{2} Y^{5} Z^{3} + 336 X Y^{6} Z^{3} + 32 X^{4} Y^{2} Z^{3} + 96 X Y^{5} Z^{3} + 384 X^{2} Y^{3} Z^{3} + 48 X^{2} Y^{2} Z^{3}

Algorithm definition

The algorithm ⟨12×17×18:2160⟩ is the projection [[0, 18], [0]] of ⟨12×18×18:2160⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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