Description of fast matrix multiplication algorithm: ⟨10×10×28:1778⟩

Algorithm type

2 X^{6} Y^{4} Z^{4} + 94 X^{4} Y^{4} Z^{4} + 6 X^{6} Y^{2} Z^{2} + 2 X^{4} Y^{2} Z^{4} + 2 X^{2} Y^{2} Z^{6} + 18 X^{4} Y^{2} Z^{2} + 40 X^{2} Y^{4} Z^{2} + 38 X^{2} Y^{2} Z^{4} + 12 X^{3} Y^{2} Z^{2} + 616 X^{2} Y^{2} Z^{2} + 36 X^{3} Y Z + 12 X^{2} Y Z^{2} + 12 X Y Z^{3} + 108 X^{2} Y Z + 240 X Y^{2} Z + 228 X Y Z^{2} + 312 X Y Z

Algorithm definition

The algorithm ⟨10×10×28:1778⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨10×10×14:889⟩.

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