Description of fast matrix multiplication algorithm: ⟨10×10×20:1280⟩

Algorithm type

80 X^{4} Y^{8} Z^{4} + 80 X^{2} Y^{8} Z^{2} + 32 X^{2} Y^{4} Z^{6} + 80 X^{2} Y^{4} Z^{4} + 128 X^{2} Y^{4} Z^{2} + 32 X Y^{4} Z^{3} + 80 X Y^{4} Z^{2} + 160 X^{2} Y^{2} Z^{2} + 128 X Y^{4} Z + 64 X Y Z^{3} + 160 X Y Z^{2} + 256 X Y Z

Algorithm definition

The algorithm ⟨10×10×20:1280⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ with ⟨5×2×5:40⟩.

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