Description of fast matrix multiplication algorithm: ⟨5×9×10:322⟩

Algorithm type

2 X^{3} Y Z^{2} + 128 X^{2} Y^{2} Z^{2} + 2 X^{2} Y Z^{3} + 52 X^{2} Y Z + 60 X Y^{2} Z + 20 X Y Z^{2} + 58 X Y Z

Algorithm definition

The algorithm ⟨5×9×10:322⟩ is the (Kronecker) tensor product of ⟨5×9×5:161⟩ with ⟨1×1×2:2⟩.

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