Description of fast matrix multiplication algorithm: ⟨3×20×22:978⟩

Algorithm type

4 X^{3} Y^{2} Z^{3} + 64 X^{2} Y^{3} Z^{3} + 32 X^{2} Y^{3} Z^{2} + 96 X Y^{3} Z^{3} + 4 X^{3} Y Z^{2} + 250 X^{2} Y^{2} Z^{2} + 4 X^{2} Y Z^{3} + 16 X Y^{2} Z^{3} + 4 X^{3} Y Z + 32 X Y^{3} Z + 64 X Y^{2} Z^{2} + 52 X Y Z^{3} + 4 X^{2} Y Z + 156 X Y^{2} Z + 136 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨3×20×22:978⟩ is the (Kronecker) tensor product of ⟨1×2×1:2⟩ with ⟨3×10×22:489⟩.

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