Description of fast matrix multiplication algorithm: ⟨3×20×21:938⟩

Algorithm type

224 X^{3} Y^{3} Z^{2} + 336 X^{3} Y^{3} Z + 36 X^{2} Y^{3} Z^{2} + 90 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 36 X^{2} Y Z^{2} + 72 X Y^{3} Z + 72 X Y^{2} Z + 60 X Y Z

Algorithm definition

The algorithm ⟨3×20×21:938⟩ is the (Kronecker) tensor product of ⟨3×10×21:469⟩ with ⟨1×2×1: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