Description of fast matrix multiplication algorithm: ⟨3×14×21:657⟩

Algorithm type

3 X^{3} Y^{3} Z + 6 X^{2} Y^{4} Z + 24 X^{2} Y^{3} Z^{2} + 9 X Y^{5} Z + 6 X^{3} Y^{2} Z + 3 X^{2} Y^{3} Z + 201 X^{2} Y^{2} Z^{2} + 39 X Y^{4} Z + 3 X Y^{3} Z^{2} + 24 X^{3} Y Z + 21 X^{2} Y^{2} Z + 3 X^{2} Y Z^{2} + 36 X Y^{3} Z + 57 X Y^{2} Z^{2} + 30 X Y Z^{3} + 75 X Y^{2} Z + 105 X Y Z^{2} + 12 X Y Z

Algorithm definition

The algorithm ⟨3×14×21:657⟩ is the (Kronecker) tensor product of ⟨3×14×7:219⟩ with ⟨1×1×3:3⟩.

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