Description of fast matrix multiplication algorithm: ⟨10×16×25:2432⟩

Algorithm type

32 X^{2} Y^{16} Z^{2} + 8 X^{4} Y^{8} Z^{6} + 32 X Y^{16} Z + 184 X^{4} Y^{8} Z^{4} + 32 X^{8} Y^{4} Z^{2} + 64 X^{2} Y^{8} Z^{4} + 8 X^{2} Y^{8} Z^{3} + 216 X^{2} Y^{8} Z^{2} + 104 X^{2} Y^{4} Z^{6} + 64 X Y^{8} Z^{2} + 32 X^{2} Y^{4} Z^{4} + 32 X Y^{8} Z + 32 X^{4} Y^{4} Z + 120 X^{2} Y^{4} Z^{2} + 104 X Y^{4} Z^{3} + 16 X^{2} Y^{2} Z^{3} + 32 X Y^{4} Z^{2} + 64 X^{4} Y Z + 368 X^{2} Y^{2} Z^{2} + 184 X Y^{4} Z + 128 X Y^{2} Z^{2} + 208 X Y Z^{3} + 64 X Y^{2} Z + 64 X Y Z^{2} + 240 X Y Z

Algorithm definition

The algorithm ⟨10×16×25:2432⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ 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