Description of fast matrix multiplication algorithm: ⟨10×16×30:2964⟩

Algorithm type

4 X^{2} Y^{16} Z^{2} + X^{4} Y^{8} Z^{6} + 16 X Y^{16} Z + 23 X^{4} Y^{8} Z^{4} + 4 X^{4} Y^{6} Z^{6} + 16 X^{2} Y^{12} Z^{2} + 4 X^{8} Y^{4} Z^{2} + 92 X^{4} Y^{6} Z^{4} + 4 X^{4} Y^{4} Z^{6} + 8 X^{2} Y^{8} Z^{4} + 32 X Y^{12} Z + 16 X^{8} Y^{3} Z^{2} + 4 X^{2} Y^{8} Z^{3} + 16 X^{8} Y^{2} Z^{2} + 92 X^{4} Y^{4} Z^{4} + 112 X^{2} Y^{8} Z^{2} + 32 X^{2} Y^{6} Z^{4} + 13 X^{2} Y^{4} Z^{6} + 8 X^{2} Y^{6} Z^{3} + 52 X^{2} Y^{3} Z^{6} + 32 X Y^{8} Z^{2} + 200 X^{2} Y^{6} Z^{2} + 36 X^{2} Y^{4} Z^{4} + 52 X^{2} Y^{2} Z^{6} + 40 X Y^{8} Z + 16 X^{4} Y^{4} Z + 6 X^{2} Y^{4} Z^{3} + 16 X^{2} Y^{3} Z^{4} + 64 X Y^{6} Z^{2} + 32 X^{4} Y^{3} Z + 169 X^{2} Y^{4} Z^{2} + 16 X^{2} Y^{2} Z^{4} + 32 X Y^{6} Z + 52 X Y^{4} Z^{3} + 24 X^{4} Y^{2} Z + 60 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 64 X Y^{4} Z^{2} + 104 X Y^{3} Z^{3} + 48 X^{4} Y Z + 336 X^{2} Y^{2} Z^{2} + 132 X Y^{4} Z + 32 X Y^{3} Z^{2} + 78 X Y^{2} Z^{3} + 120 X Y^{3} Z + 120 X Y^{2} Z^{2} + 156 X Y Z^{3} + 138 X Y^{2} Z + 48 X Y Z^{2} + 180 X Y Z

Algorithm definition

The algorithm ⟨10×16×30:2964⟩ is the (Kronecker) tensor product of ⟨2×4×6:39⟩ with ⟨5×4×5:76⟩.

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