Description of fast matrix multiplication algorithm: ⟨8×10×22:1120⟩

Algorithm type

60 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{6} + 5 X^{4} Y^{2} Z^{2} + 33 X^{2} Y^{4} Z^{2} + 29 X^{2} Y^{2} Z^{4} + 380 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z + 36 X Y^{2} Z^{2} + 18 X Y Z^{3} + 30 X^{2} Y Z + 198 X Y^{2} Z + 174 X Y Z^{2} + 120 X Y Z

Algorithm definition

The algorithm ⟨8×10×22:1120⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×5×11:160⟩.

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