Description of fast matrix multiplication algorithm: ⟨8×14×32:2208⟩

Algorithm type

32 X^{4} Y^{8} Z^{4} + 48 X^{4} Y^{6} Z^{4} + 80 X^{4} Y^{4} Z^{4} + 56 X^{2} Y^{8} Z^{2} + 56 X^{2} Y^{7} Z^{2} + 8 X^{2} Y^{6} Z^{2} + 32 X^{2} Y^{5} Z^{2} + 272 X^{2} Y^{4} Z^{2} + 88 X^{2} Y^{3} Z^{2} + 384 X^{2} Y^{2} Z^{2} + 272 X Y^{4} Z + 64 X Y^{3} Z + 320 X Y^{2} Z + 496 X Y Z

Algorithm definition

The algorithm ⟨8×14×32:2208⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨8×14×16:1104⟩.

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