Description of fast matrix multiplication algorithm: ⟨6×20×25:1880⟩

Algorithm type

130 X^{4} Y^{4} Z^{4} + 8 X Y^{9} Z + 30 X^{6} Y^{2} Z^{2} + 10 X^{4} Y^{4} Z^{2} + 72 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 40 X^{2} Y^{2} Z^{6} + 4 X^{2} Y^{6} Z + 8 X Y^{6} Z^{2} + 30 X^{4} Y^{2} Z^{2} + 210 X^{2} Y^{4} Z^{2} + 60 X^{2} Y^{2} Z^{4} + 52 X Y^{6} Z + 12 X^{3} Y^{3} Z + 10 X^{2} Y^{4} Z + 20 X Y^{4} Z^{2} + 16 X Y^{3} Z^{3} + 30 X^{3} Y^{2} Z + 12 X^{2} Y^{3} Z + 258 X^{2} Y^{2} Z^{2} + 80 X Y^{4} Z + 24 X Y^{3} Z^{2} + 40 X Y^{2} Z^{3} + 48 X^{3} Y Z + 46 X^{2} Y^{2} Z + 52 X Y^{3} Z + 92 X Y^{2} Z^{2} + 64 X Y Z^{3} + 48 X^{2} Y Z + 178 X Y^{2} Z + 96 X Y Z^{2} + 80 X Y Z

Algorithm definition

The algorithm ⟨6×20×25:1880⟩ is the (Kronecker) tensor product of ⟨2×5×5:40⟩ with ⟨3×4×5:47⟩.

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