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

Algorithm type

24 X^{6} Y^{8} Z^{6} + 8 X^{9} Y^{4} Z^{3} + 32 X^{6} Y^{4} Z^{3} + 192 X^{4} Y^{4} Z^{4} + 24 X^{2} Y^{8} Z^{2} + 64 X^{6} Y^{2} Z^{2} + 40 X^{3} Y^{4} Z^{3} + 256 X^{4} Y^{2} Z^{2} + 8 X^{3} Y^{4} Z + 32 X^{2} Y^{4} Z + 704 X^{2} Y^{2} Z^{2} + 40 X Y^{4} Z + 128 X^{3} Y Z + 512 X^{2} Y Z + 640 X Y Z

Algorithm definition

The algorithm ⟨16×16×18:2704⟩ is the (Kronecker) tensor product of ⟨4×4×2:26⟩ with ⟨4×4×9:104⟩.

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