Description of fast matrix multiplication algorithm: ⟨4×24×28:1739⟩

Algorithm type

2 X Y^{15} Z + 18 X^{4} Y^{6} Z^{4} + 6 X^{2} Y^{10} Z^{2} + 14 X Y^{12} Z + 6 X^{2} Y^{9} Z^{2} + 85 X^{4} Y^{4} Z^{4} + 42 X^{2} Y^{8} Z^{2} + 8 X Y^{10} Z + 12 X Y^{9} Z + 88 X^{2} Y^{6} Z^{2} + 56 X Y^{8} Z + 166 X^{2} Y^{4} Z^{2} + 66 X Y^{6} Z + 30 X^{2} Y^{3} Z^{2} + 10 X Y^{5} Z + 302 X^{2} Y^{2} Z^{2} + 142 X Y^{4} Z + 110 X Y^{3} Z + 290 X Y^{2} Z + 286 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