Description of fast matrix multiplication algorithm: ⟨3×18×19:768⟩

Algorithm type

240 X^{3} Y^{3} Z^{2} + 360 X^{3} Y^{3} Z + 6 X^{2} Y^{3} Z^{2} + 42 X^{2} Y^{2} Z^{2} + 42 X^{2} Y Z + 18 X Y^{2} Z + 60 X Y Z

Algorithm definition

The algorithm ⟨3×18×19:768⟩ is the (Kronecker) tensor product of ⟨3×6×19:256⟩ with ⟨1×3×1:3⟩.

Algorithm description

maple tensor 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