Description of fast matrix multiplication algorithm: ⟨6×8×15:488⟩

Algorithm type

20 X^{4} Y^{4} Z^{4} + 20 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{2} Z^{6} + 24 X^{2} Y^{2} Z^{4} + 8 X^{2} Y^{3} Z^{2} + 8 X Y^{3} Z^{3} + 112 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z^{2} + 12 X^{3} Y Z + 4 X^{2} Y^{2} Z + 64 X Y^{3} Z + 8 X Y^{2} Z^{2} + 24 X Y Z^{3} + 12 X^{2} Y Z + 24 X Y^{2} Z + 48 X Y Z^{2} + 68 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