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

Algorithm type

106 X^{4} Y^{4} Z^{4} + 4 X^{6} Y^{2} Z^{2} + 10 X^{4} Y^{2} Z^{2} + 36 X^{2} Y^{4} Z^{2} + 36 X^{2} Y^{2} Z^{4} + 688 X^{2} Y^{2} Z^{2} + 24 X^{3} Y Z + 60 X^{2} Y Z + 216 X Y^{2} Z + 216 X Y Z^{2} + 312 X Y Z

Algorithm definition

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

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