Description of fast matrix multiplication algorithm: ⟨4×7×28:570⟩

Algorithm type

2 X^{3} Y^{7} Z^{4} + 8 X^{4} Y^{4} Z^{4} + 2 X^{3} Y^{5} Z^{4} + 8 X^{4} Y^{3} Z^{4} + 6 X^{2} Y^{7} Z^{2} + 2 X^{3} Y^{3} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 2 X Y^{7} Z^{2} + 8 X^{2} Y^{5} Z^{2} + 2 X Y^{6} Z^{2} + 8 X^{2} Y^{4} Z^{2} + 8 X^{2} Y^{3} Z^{2} + 134 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 6 X^{2} Y Z^{2} + 60 X Y^{3} Z + 48 X Y^{2} Z + 240 X Y Z

Algorithm definition

The algorithm ⟨4×7×28:570⟩ is the (Kronecker) tensor product of ⟨4×7×14:285⟩ 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