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

Algorithm type

1974 X^{3} Y^{3} Z^{3} + 306 X^{3} Y^{2} Z^{3} + 726 X^{3} Y^{3} Z + 181 X^{3} Y^{2} Z^{2} + 478 X^{2} Y^{3} Z^{2} + 172 X^{2} Y^{2} Z^{3} + 57 X^{3} Y^{2} Z + 9 X^{3} Y Z^{2} + 57 X^{2} Y^{3} Z + 319 X^{2} Y^{2} Z^{2} + 18 X^{2} Y Z^{3} + 91 X^{2} Y^{2} Z + 23 X^{2} Y Z^{2} + 18 X Y^{3} Z + 10 X Y^{2} Z^{2} + 783 X Y Z^{3} + 2 X^{2} Y Z + 22 X Y^{2} Z + 97 X Y Z^{2} + 87 X Y Z

Algorithm definition

The algorithm ⟨21×21×22:5430⟩ is the projection [[1, 2], [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