Description of fast matrix multiplication algorithm: ⟨10×10×25:1600⟩

Algorithm type

100 X^{4} Y^{4} Z^{4} + 40 X^{2} Y^{6} Z^{2} + 40 X^{2} Y^{2} Z^{6} + 100 X^{2} Y^{4} Z^{2} + 100 X^{2} Y^{2} Z^{4} + 16 X Y^{3} Z^{3} + 320 X^{2} Y^{2} Z^{2} + 40 X Y^{3} Z^{2} + 40 X Y^{2} Z^{3} + 64 X Y^{3} Z + 100 X Y^{2} Z^{2} + 64 X Y Z^{3} + 160 X Y^{2} Z + 160 X Y Z^{2} + 256 X Y Z

Algorithm definition

The algorithm ⟨10×10×25:1600⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨5×2×5:40⟩.

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