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

Algorithm type

6 X^{16} Y^{16} Z^{16} + 2 X^{8} Y^{24} Z^{8} + 8 X^{8} Y^{16} Z^{8} + 118 X^{8} Y^{8} Z^{8} + 36 X^{4} Y^{12} Z^{4} + 144 X^{4} Y^{8} Z^{4} + 828 X^{4} Y^{4} Z^{4} + 216 X^{2} Y^{6} Z^{2} + 864 X^{2} Y^{4} Z^{2} + 2376 X^{2} Y^{2} Z^{2} + 432 X Y^{3} Z + 1728 X Y^{2} Z + 2160 X Y Z

Algorithm definition

The algorithm ⟨16×32×32:8918⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨8×16×16:1274⟩.

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