Description of fast matrix multiplication algorithm: ⟨10×10×14:889⟩

Algorithm type

X^{6} Y^{4} Z^{4} + 47 X^{4} Y^{4} Z^{4} + 3 X^{6} Y^{2} Z^{2} + X^{4} Y^{2} Z^{4} + X^{2} Y^{2} Z^{6} + 9 X^{4} Y^{2} Z^{2} + 20 X^{2} Y^{4} Z^{2} + 19 X^{2} Y^{2} Z^{4} + 6 X^{3} Y^{2} Z^{2} + 308 X^{2} Y^{2} Z^{2} + 18 X^{3} Y Z + 6 X^{2} Y Z^{2} + 6 X Y Z^{3} + 54 X^{2} Y Z + 120 X Y^{2} Z + 114 X Y Z^{2} + 156 X Y Z

Algorithm definition

The algorithm ⟨10×10×14:889⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×5×7:127⟩.

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