Description of fast matrix multiplication algorithm: ⟨3×11×28:690⟩

Algorithm type

40 X^{2} Y^{3} Z^{2} + 6 X Y^{5} Z + 4 X Y^{4} Z^{2} + 2 X Y^{3} Z^{3} + 2 X^{2} Y^{3} Z + 194 X^{2} Y^{2} Z^{2} + 34 X Y^{4} Z + 2 X Y^{3} Z^{2} + 4 X Y^{2} Z^{3} + 20 X^{3} Y Z + 38 X^{2} Y^{2} Z + 26 X^{2} Y Z^{2} + 72 X Y^{3} Z + 14 X Y^{2} Z^{2} + 16 X Y Z^{3} + 70 X^{2} Y Z + 98 X Y^{2} Z + 48 X Y Z

Algorithm definition

The algorithm ⟨3×11×28:690⟩ is the (Kronecker) tensor product of ⟨3×11×14:345⟩ 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