Description of fast matrix multiplication algorithm: ⟨4×14×32:1196⟩

Algorithm type

4 X^{4} Y^{8} Z^{4} + 24 X^{4} Y^{6} Z^{4} + 32 X^{4} Y^{4} Z^{4} + 46 X^{2} Y^{8} Z^{2} + 24 X^{2} Y^{7} Z^{2} + 32 X^{2} Y^{6} Z^{2} + 64 X Y^{8} Z + 16 X^{2} Y^{5} Z^{2} + 8 X Y^{7} Z + 86 X^{2} Y^{4} Z^{2} + 40 X^{2} Y^{3} Z^{2} + 12 X Y^{5} Z + 172 X^{2} Y^{2} Z^{2} + 180 X Y^{4} Z + 112 X Y^{3} Z + 100 X Y^{2} Z + 244 X Y Z

Algorithm definition

The algorithm ⟨4×14×32:1196⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×14×16:598⟩.

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