Description of fast matrix multiplication algorithm: ⟨8×9×21:985⟩

Algorithm type

3 X^{4} Y^{6} Z^{4} + 6 X^{4} Y^{4} Z^{6} + 45 X^{4} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{8} + 6 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{4} Z^{3} + 16 X^{3} Y^{2} Z^{3} + 102 X^{2} Y^{4} Z^{2} + 42 X^{2} Y^{2} Z^{4} + 24 X^{3} Y Z^{3} + 6 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 6 X Y^{2} Z^{4} + 156 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 24 X Y^{2} Z^{3} + 6 X Y Z^{4} + 84 X Y^{2} Z^{2} + 24 X Y Z^{3} + 156 X Y^{2} Z + 84 X Y Z^{2} + 132 X Y Z

Algorithm definition

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