Description of fast matrix multiplication algorithm: ⟨3×14×27:843⟩

Algorithm type

3 X^{3} Y^{3} Z^{2} + 18 X^{2} Y^{4} Z^{2} + 9 X Y^{6} Z + 3 X^{3} Y^{2} Z^{2} + 3 X^{2} Y^{4} Z + 48 X^{2} Y^{3} Z^{2} + 6 X Y^{5} Z + 3 X^{3} Y^{2} Z + 3 X^{2} Y^{3} Z + 219 X^{2} Y^{2} Z^{2} + 21 X Y^{4} Z + 30 X^{3} Y Z + 87 X^{2} Y^{2} Z + 57 X Y^{3} Z + 36 X Y Z^{3} + 120 X^{2} Y Z + 144 X Y^{2} Z + 18 X Y Z^{2} + 15 X Y Z

Algorithm definition

The algorithm ⟨3×14×27:843⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×14×9:281⟩.

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