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

Algorithm type

32 X^{6} Y^{8} Z^{12} + 32 X^{3} Y^{4} Z^{12} + 256 X^{4} Y^{4} Z^{8} + 32 X^{2} Y^{8} Z^{4} + 256 X^{2} Y^{2} Z^{8} + 64 X^{3} Y^{4} Z^{3} + 32 X Y^{4} Z^{4} + 512 X^{2} Y^{2} Z^{4} + 512 X^{2} Y^{2} Z^{2} + 64 X Y^{4} Z + 512 X Y Z^{4} + 1024 X Y Z

Algorithm definition

The algorithm ⟨16×18×20:3328⟩ is the (Kronecker) tensor product of ⟨4×2×5:32⟩ with ⟨4×9×4:104⟩.

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