Description of fast matrix multiplication algorithm: ⟨9×15×15:1290⟩

Algorithm type

81 X^{4} Y^{4} Z^{4} + 18 X^{6} Y^{2} Z^{2} + 18 X^{2} Y^{2} Z^{6} + 54 X^{4} Y^{2} Z^{2} + 32 X^{3} Y^{3} Z^{2} + 108 X^{2} Y^{4} Z^{2} + 54 X^{2} Y^{2} Z^{4} + 48 X^{3} Y^{3} Z + 4 X^{3} Y Z^{3} + 12 X^{3} Y^{2} Z + 12 X^{3} Y Z^{2} + 212 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z^{3} + 36 X Y^{4} Z + 12 X Y^{2} Z^{3} + 22 X^{3} Y Z + 40 X^{2} Y^{2} Z + 36 X^{2} Y Z^{2} + 4 X Y^{3} Z + 36 X Y^{2} Z^{2} + 28 X Y Z^{3} + 62 X^{2} Y Z + 140 X Y^{2} Z + 78 X Y Z^{2} + 131 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