Description of fast matrix multiplication algorithm: ⟨21×22×22:5476⟩

Algorithm type

2280 X^{3} Y^{3} Z^{3} + 800 X^{3} Y^{3} Z + 190 X^{3} Y^{2} Z^{2} + 560 X^{2} Y^{3} Z^{2} + 190 X^{2} Y^{2} Z^{3} + 20 X^{3} Y^{2} Z + 61 X^{2} Y^{3} Z + 260 X^{2} Y^{2} Z^{2} + 53 X^{2} Y^{2} Z + 20 X Y^{3} Z + 10 X Y^{2} Z^{2} + 820 X Y Z^{3} + 22 X Y^{2} Z + 104 X Y Z^{2} + 86 X Y Z

Algorithm definition

The algorithm ⟨21×22×22:5476⟩ is the projection [[1, 0], [0]] of ⟨22×22×22:5566⟩.

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