Description of fast matrix multiplication algorithm: ⟨8×10×21:1108⟩

Algorithm type

16 X^{4} Y^{6} Z^{4} + 40 X^{4} Y^{4} Z^{4} + 20 X^{2} Y^{8} Z^{2} + 16 X^{2} Y^{3} Z^{6} + 44 X^{2} Y^{6} Z^{2} + 40 X^{2} Y^{2} Z^{6} + 28 X^{2} Y^{4} Z^{2} + 20 X Y^{4} Z^{3} + 20 X^{2} Y^{3} Z^{2} + 8 X^{2} Y^{2} Z^{3} + 44 X Y^{3} Z^{3} + 16 X^{4} Y Z + 4 X^{3} Y Z^{2} + 228 X^{2} Y^{2} Z^{2} + 20 X Y^{4} Z + 28 X Y^{2} Z^{3} + 16 X Y Z^{4} + 16 X^{3} Y Z + 96 X Y^{3} Z + 32 X Y^{2} Z^{2} + 76 X Y Z^{3} + 16 X^{2} Y Z + 44 X Y^{2} Z + 76 X Y Z^{2} + 144 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