Description of fast matrix multiplication algorithm: ⟨4×14×30:1114⟩

Algorithm type

32 X^{4} Y^{8} Z^{4} + 32 X^{4} Y^{6} Z^{4} + 34 X^{2} Y^{10} Z^{2} + 64 X^{2} Y^{8} Z^{2} + 36 X Y^{10} Z + 2 X^{2} Y^{7} Z^{2} + 74 X^{2} Y^{6} Z^{2} + 36 X Y^{8} Z + 8 X^{2} Y^{5} Z^{2} + 10 X Y^{7} Z + 60 X^{2} Y^{4} Z^{2} + 42 X Y^{6} Z + 58 X^{2} Y^{3} Z^{2} + 30 X Y^{5} Z + 98 X^{2} Y^{2} Z^{2} + 64 X Y^{4} Z + 16 X^{2} Y Z^{2} + 140 X Y^{3} Z + 158 X Y^{2} Z + 120 X Y Z

Algorithm definition

The algorithm ⟨4×14×30:1114⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×14×15:557⟩.

Algorithm description

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