Description of fast matrix multiplication algorithm: ⟨3×5×21:240⟩

Algorithm type

6 X^{2} Y^{4} Z^{2} + 12 X^{2} Y^{3} Z^{2} + 60 X^{2} Y^{2} Z^{2} + 9 X Y^{4} Z + 3 X Y^{3} Z^{2} + 21 X Y^{3} Z + 12 X Y^{2} Z^{2} + 6 X Y Z^{3} + 27 X Y^{2} Z + 27 X Y Z^{2} + 57 X Y Z

Algorithm definition

The algorithm ⟨3×5×21:240⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨3×5×7:80⟩.

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