Description of fast matrix multiplication algorithm: ⟨10×10×18:1127⟩

Algorithm type

X^{6} Y^{2} Z^{4} + 64 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{6} + 10 X^{4} Y^{2} Z^{2} + 30 X^{2} Y^{4} Z^{2} + 26 X^{2} Y^{2} Z^{4} + 6 X^{3} Y Z^{2} + 413 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 60 X^{2} Y Z + 180 X Y^{2} Z + 156 X Y Z^{2} + 174 X Y Z

Algorithm definition

The algorithm ⟨10×10×18:1127⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨5×5×9:161⟩.

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