Description of fast matrix multiplication algorithm: ⟨3×11×30:738⟩

Algorithm type

160 X^{3} Y^{3} Z^{2} + 240 X^{3} Y^{3} Z + 2 X^{3} Y Z^{3} + 10 X^{2} Y^{3} Z^{2} + 102 X^{2} Y^{2} Z^{2} + 4 X Y^{4} Z + 2 X Y^{2} Z^{3} + 6 X^{3} Y Z + 18 X Y^{3} Z + 26 X Y^{2} Z^{2} + 34 X Y Z^{3} + 6 X^{2} Y Z + 60 X Y^{2} Z + 52 X Y Z^{2} + 16 X Y Z

Algorithm definition

The algorithm ⟨3×11×30:738⟩ is the (Kronecker) tensor product of ⟨3×11×15:369⟩ 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