Description of fast matrix multiplication algorithm: ⟨4×10×32:882⟩

Algorithm type

2 X^{4} Y^{10} Z^{4} + 8 X^{4} Y^{8} Z^{4} + 2 X^{4} Y^{6} Z^{4} + 14 X^{2} Y^{10} Z^{2} + 22 X^{4} Y^{4} Z^{4} + 12 X^{2} Y^{8} Z^{2} + 16 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{5} Z^{2} + 64 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{3} Z^{2} + 84 X Y^{5} Z + 166 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 96 X Y^{3} Z + 96 X Y^{2} Z + 204 X Y Z

Algorithm definition

The algorithm ⟨4×10×32:882⟩ is the (Kronecker) tensor product of ⟨2×5×16:126⟩ with ⟨2×2×2:7⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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