Description of fast matrix multiplication algorithm: ⟨3×13×27:783⟩

Algorithm type

144 X^{3} Y^{3} Z^{2} + 216 X^{3} Y^{3} Z + 18 X^{2} Y^{3} Z^{2} + 126 X^{2} Y^{2} Z^{2} + 9 X Y^{4} Z + 18 X^{3} Y Z + 36 X^{2} Y^{2} Z + 33 X Y^{3} Z + 18 X Y Z^{3} + 78 X^{2} Y Z + 75 X Y^{2} Z + 12 X Y Z

Algorithm definition

The algorithm ⟨3×13×27:783⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×13×9:261⟩.

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