Description of fast matrix multiplication algorithm: ⟨3×17×32:1216⟩

Algorithm type

256 X^{3} Y^{3} Z^{2} + 384 X^{3} Y^{3} Z + 4 X^{3} Y Z^{3} + 12 X^{2} Y^{3} Z^{2} + 180 X^{2} Y^{2} Z^{2} + 4 X Y^{2} Z^{3} + 4 X^{3} Y Z + 20 X Y^{3} Z + 28 X Y^{2} Z^{2} + 40 X Y Z^{3} + 76 X^{2} Y Z + 136 X Y^{2} Z + 56 X Y Z^{2} + 16 X Y Z

Algorithm definition

The algorithm ⟨3×17×32:1216⟩ is the (Kronecker) tensor product of ⟨3×17×16:608⟩ 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