Description of fast matrix multiplication algorithm: ⟨4×10×10:280⟩

Algorithm type

10 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{6} Z^{2} + 10 X^{2} Y^{4} Z^{2} + 76 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z + 60 X Y^{2} Z + 96 X Y Z

Algorithm definition

The algorithm ⟨4×10×10:280⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×5×5:40⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

Algorithm symmetries

The following group of 12 isotropies acts as a permutation group on algorithm tensor representation:

maple tensor representation (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