Description of fast matrix multiplication algorithm: ⟨16×24×32:6820⟩

Algorithm type

4 X^{16} Y^{16} Z^{16} + 4 X^{8} Y^{24} Z^{8} + 76 X^{8} Y^{8} Z^{8} + 72 X^{4} Y^{12} Z^{4} + 648 X^{4} Y^{4} Z^{4} + 528 X^{2} Y^{6} Z^{2} + 48 X^{2} Y^{2} Z^{6} + 144 X^{2} Y^{4} Z^{2} + 192 X^{2} Y^{2} Z^{4} + 32 X Y^{3} Z^{3} + 1776 X^{2} Y^{2} Z^{2} + 128 X Y^{3} Z^{2} + 48 X Y^{2} Z^{3} + 1024 X Y^{3} Z + 192 X Y^{2} Z^{2} + 80 X Y Z^{3} + 240 X Y^{2} Z + 320 X Y Z^{2} + 1264 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