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

Algorithm type

16 X^{2} Y^{4} Z^{2} + 16 X Y^{4} Z + 32 X Y Z

Algorithm definition

The algorithm ⟨2×4×10:64⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×4×5:32⟩.

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 8 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