Description of fast matrix multiplication algorithm: ⟨2×7×21:228⟩

Algorithm type

6 X^{2} Y^{6} Z^{2} + 12 X^{2} Y^{5} Z^{2} + 9 X Y^{7} Z + 12 X^{2} Y^{4} Z^{2} + 3 X Y^{6} Z + 9 X^{2} Y^{3} Z^{2} + 51 X Y^{5} Z + 27 X^{2} Y^{2} Z^{2} + 18 X Y^{4} Z + 3 X^{2} Y Z^{2} + 27 X Y^{3} Z + 15 X Y^{2} Z + 36 X Y Z

Algorithm definition

The algorithm ⟨2×7×21:228⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨2×7×7:76⟩.

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