Description of fast matrix multiplication algorithm: ⟨2×11×30:510⟩

Algorithm type

4 X Y^{8} Z + 8 X Y^{7} Z + 20 X Y^{6} Z + 20 X^{2} Y^{3} Z^{2} + 22 X Y^{5} Z + 130 X^{2} Y^{2} Z^{2} + 6 X Y^{4} Z + 4 X Y^{3} Z + 48 X Y^{2} Z + 248 X Y Z

Algorithm definition

The algorithm ⟨2×11×30:510⟩ is the (Kronecker) tensor product of ⟨2×11×15:255⟩ 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).

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