Description of fast matrix multiplication algorithm: ⟨4×11×32:980⟩

Algorithm type

30 X^{4} Y^{4} Z^{4} + 6 X^{4} Y^{3} Z^{4} + 6 X^{3} Y^{4} Z^{4} + 8 X Y^{9} Z + 6 X^{3} Y^{3} Z^{4} + 36 X^{2} Y^{6} Z^{2} + 8 X Y^{8} Z + 22 X^{2} Y^{5} Z^{2} + 52 X^{2} Y^{4} Z^{2} + 40 X Y^{6} Z + 6 X Y^{5} Z^{2} + 4 X^{2} Y^{3} Z^{2} + 8 X Y^{5} Z + 194 X^{2} Y^{2} Z^{2} + 12 X^{2} Y Z^{2} + 100 X Y^{3} Z + 6 X Y^{2} Z^{2} + 192 X Y^{2} Z + 244 X Y Z

Algorithm definition

The algorithm ⟨4×11×32:980⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×11×16:490⟩.

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