Description of fast matrix multiplication algorithm: ⟨8×15×20:1520⟩

Algorithm type

100 X^{4} Y^{4} Z^{4} + 12 X Y^{9} Z + 30 X^{6} Y^{2} Z^{2} + 20 X^{4} Y^{2} Z^{4} + 70 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 20 X^{2} Y^{2} Z^{6} + 8 X Y^{6} Z^{2} + 10 X^{4} Y^{2} Z^{2} + 110 X^{2} Y^{4} Z^{2} + 110 X^{2} Y^{2} Z^{4} + 34 X Y^{6} Z + 12 X^{3} Y^{3} Z + 8 X^{2} Y^{3} Z^{2} + 20 X Y^{4} Z^{2} + 8 X Y^{3} Z^{3} + 30 X^{3} Y^{2} Z + 4 X^{2} Y^{3} Z + 210 X^{2} Y^{2} Z^{2} + 10 X Y^{4} Z + 44 X Y^{3} Z^{2} + 20 X Y^{2} Z^{3} + 48 X^{3} Y Z + 10 X^{2} Y^{2} Z + 32 X^{2} Y Z^{2} + 60 X Y^{3} Z + 142 X Y^{2} Z^{2} + 32 X Y Z^{3} + 16 X^{2} Y Z + 46 X Y^{2} Z + 176 X Y Z^{2} + 48 X Y Z

Algorithm definition

The algorithm ⟨8×15×20:1520⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨4×3×4:38⟩.

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