Description of fast matrix multiplication algorithm: ⟨4×11×30:898⟩

Algorithm type

2 X^{4} Y^{6} Z^{4} + 10 X^{4} Y^{5} Z^{4} + 22 X^{4} Y^{4} Z^{4} + 32 X^{2} Y^{7} Z^{2} + 36 X^{2} Y^{6} Z^{2} + 64 X^{2} Y^{5} Z^{2} + 2 X^{2} Y^{3} Z^{4} + 32 X Y^{7} Z + 64 X^{2} Y^{4} Z^{2} + 40 X Y^{6} Z + 2 X Y^{5} Z^{2} + 60 X^{2} Y^{3} Z^{2} + 68 X Y^{5} Z + 62 X^{2} Y^{2} Z^{2} + 40 X Y^{4} Z + 4 X Y^{3} Z^{2} + 204 X Y^{3} Z + 4 X Y^{2} Z^{2} + 94 X Y^{2} Z + 2 X Y Z^{2} + 54 X Y Z

Algorithm definition

The algorithm ⟨4×11×30:898⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨4×11×15:449⟩.

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