Description of fast matrix multiplication algorithm: ⟨10×16×20:1976⟩

Algorithm type

6 X^{4} Y^{4} Z^{6} + 8 X Y^{12} Z + 24 X^{8} Y^{2} Z^{2} + 138 X^{4} Y^{4} Z^{4} + 24 X^{2} Y^{8} Z^{2} + 2 X^{2} Y^{6} Z^{3} + 46 X^{2} Y^{6} Z^{2} + 48 X^{2} Y^{4} Z^{4} + 78 X^{2} Y^{2} Z^{6} + 32 X Y^{8} Z + 8 X^{2} Y^{4} Z^{3} + 16 X Y^{6} Z^{2} + 8 X^{4} Y^{3} Z + 208 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 8 X Y^{6} Z + 32 X^{4} Y^{2} Z + 10 X^{2} Y^{2} Z^{3} + 64 X Y^{4} Z^{2} + 26 X Y^{3} Z^{3} + 40 X^{4} Y Z + 320 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 8 X Y^{3} Z^{2} + 104 X Y^{2} Z^{3} + 30 X Y^{3} Z + 112 X Y^{2} Z^{2} + 130 X Y Z^{3} + 160 X Y^{2} Z + 40 X Y Z^{2} + 150 X Y Z

Algorithm definition

The algorithm ⟨10×16×20:1976⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ 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