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

Algorithm type

2 X^{3} Y^{3} Z + 4 X^{2} Y^{4} Z + 16 X^{2} Y^{3} Z^{2} + 6 X Y^{5} Z + 4 X^{3} Y^{2} Z + 2 X^{2} Y^{3} Z + 134 X^{2} Y^{2} Z^{2} + 26 X Y^{4} Z + 2 X Y^{3} Z^{2} + 16 X^{3} Y Z + 14 X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + 24 X Y^{3} Z + 38 X Y^{2} Z^{2} + 20 X Y Z^{3} + 50 X Y^{2} Z + 70 X Y Z^{2} + 8 X Y Z

Algorithm definition

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