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

Algorithm type

5 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{4} Z^{2} + 42 X^{2} Y^{2} Z^{2} + 12 X Y^{3} Z + 36 X Y^{2} Z + 72 X Y Z

Algorithm definition

The algorithm ⟨4×6×10:175⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×3×5:25⟩.

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