Description of fast matrix multiplication algorithm: ⟨16×20×20:3648⟩

Algorithm type

16 X^{4} Y^{6} Z^{4} + 64 X^{8} Y^{2} Z^{2} + 368 X^{4} Y^{4} Z^{4} + 64 X^{2} Y^{2} Z^{8} + 208 X^{2} Y^{6} Z^{2} + 128 X^{2} Y^{4} Z^{4} + 64 X^{2} Y^{4} Z^{2} + 64 X^{2} Y^{2} Z^{4} + 32 X^{2} Y^{3} Z^{2} + 128 X^{4} Y Z + 976 X^{2} Y^{2} Z^{2} + 128 X Y Z^{4} + 416 X Y^{3} Z + 256 X Y^{2} Z^{2} + 128 X Y^{2} Z + 128 X Y Z^{2} + 480 X Y Z

Algorithm definition

The algorithm ⟨16×20×20:3648⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨4×5×5:76⟩.

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