Description of fast matrix multiplication algorithm: ⟨2×13×28:560⟩

Algorithm type

2 X Y^{11} Z + 6 X^{2} Y^{8} Z^{2} + 18 X Y^{10} Z + 18 X^{2} Y^{7} Z^{2} + 16 X Y^{9} Z + 14 X^{2} Y^{6} Z^{2} + 8 X Y^{8} Z + 16 X^{2} Y^{5} Z^{2} + 24 X Y^{7} Z + 12 X^{2} Y^{4} Z^{2} + 18 X Y^{6} Z + 36 X^{2} Y^{3} Z^{2} + 18 X Y^{5} Z + 66 X^{2} Y^{2} Z^{2} + 22 X Y^{4} Z + 18 X Y^{3} Z + 42 X Y^{2} Z + 206 X Y Z

Algorithm definition

The algorithm ⟨2×13×28:560⟩ is the (Kronecker) tensor product of ⟨2×13×14:280⟩ with ⟨1×1×2:2⟩.

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