Description of fast matrix multiplication algorithm: ⟨2×12×28:518⟩

Algorithm type

4 X Y^{11} Z + 8 X Y^{10} Z + 2 X Y^{9} Z + 12 X Y^{8} Z + 2 X^{2} Y^{5} Z^{2} + 14 X Y^{7} Z + 10 X^{2} Y^{4} Z^{2} + 14 X Y^{6} Z + 66 X^{2} Y^{3} Z^{2} + 10 X Y^{5} Z + 76 X^{2} Y^{2} Z^{2} + 10 X Y^{4} Z + 18 X Y^{3} Z + 72 X Y^{2} Z + 200 X Y Z

Algorithm definition

The algorithm ⟨2×12×28:518⟩ is the (Kronecker) tensor product of ⟨2×12×14:259⟩ 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