Description of fast matrix multiplication algorithm: ⟨10×25×28:4064⟩

Algorithm type

8 X^{6} Y^{8} Z^{4} + 376 X^{4} Y^{8} Z^{4} + 8 X^{3} Y^{8} Z^{2} + 24 X^{6} Y^{4} Z^{2} + 8 X^{4} Y^{4} Z^{4} + 536 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{4} Z^{6} + 72 X^{4} Y^{4} Z^{2} + 152 X^{2} Y^{4} Z^{4} + 160 X Y^{8} Z + 24 X^{3} Y^{4} Z + 216 X^{2} Y^{4} Z^{2} + 8 X Y^{4} Z^{3} + 16 X^{3} Y^{2} Z^{2} + 72 X^{2} Y^{4} Z + 152 X Y^{4} Z^{2} + 752 X^{2} Y^{2} Z^{2} + 208 X Y^{4} Z + 48 X^{3} Y Z + 16 X^{2} Y Z^{2} + 16 X Y Z^{3} + 144 X^{2} Y Z + 320 X Y^{2} Z + 304 X Y Z^{2} + 416 X Y Z

Algorithm definition

The algorithm ⟨10×25×28:4064⟩ is the (Kronecker) tensor product of ⟨2×5×4:32⟩ with ⟨5×5×7:127⟩.

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