Description of fast matrix multiplication algorithm: ⟨31×32×32:15006⟩

Algorithm type

8120 X^{3} Y^{3} Z^{3} + 1800 X^{3} Y^{3} Z + 435 X^{3} Y^{2} Z^{2} + 1290 X^{2} Y^{3} Z^{2} + 435 X^{2} Y^{2} Z^{3} + 30 X^{3} Y^{2} Z + 91 X^{2} Y^{3} Z + 540 X^{2} Y^{2} Z^{2} + 78 X^{2} Y^{2} Z + 30 X Y^{3} Z + 15 X Y^{2} Z^{2} + 1830 X Y Z^{3} + 32 X Y^{2} Z + 154 X Y Z^{2} + 126 X Y Z

Algorithm definition

The algorithm ⟨31×32×32:15006⟩ is the projection [[1, 0], [0]] of ⟨32×32×32:15136⟩.

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