Description of fast matrix multiplication algorithm: ⟨20×20×32:6912⟩

Algorithm type

896 X^{4} Y^{4} Z^{4} + 16 X^{6} Y^{2} Z^{2} + 32 X^{2} Y^{6} Z^{2} + 48 X^{2} Y^{4} Z^{4} + 32 X^{2} Y^{2} Z^{6} + 208 X^{4} Y^{2} Z^{2} + 384 X^{2} Y^{4} Z^{2} + 352 X^{2} Y^{2} Z^{4} + 2128 X^{2} Y^{2} Z^{2} + 32 X^{3} Y Z + 64 X Y^{3} Z + 96 X Y^{2} Z^{2} + 64 X Y Z^{3} + 416 X^{2} Y Z + 768 X Y^{2} Z + 704 X Y Z^{2} + 672 X Y Z

Algorithm definition

The algorithm ⟨20×20×32:6912⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨5×5×8:144⟩.

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