Description of fast matrix multiplication algorithm: ⟨8×32×32:4732⟩

Algorithm type

36 X^{8} Y^{8} Z^{8} + 4 X^{2} Y^{18} Z^{2} + 24 X^{4} Y^{12} Z^{4} + 96 X^{4} Y^{8} Z^{4} + 32 X^{2} Y^{12} Z^{2} + 336 X^{4} Y^{4} Z^{4} + 64 X^{2} Y^{8} Z^{2} + 24 X Y^{9} Z + 184 X^{2} Y^{6} Z^{2} + 736 X^{2} Y^{4} Z^{2} + 192 X Y^{6} Z + 820 X^{2} Y^{2} Z^{2} + 384 X Y^{4} Z + 240 X Y^{3} Z + 960 X Y^{2} Z + 600 X Y Z

Algorithm definition

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

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