Description of fast matrix multiplication algorithm: ⟨9×14×25:1975⟩

Algorithm type

10 X^{4} Y^{6} Z^{4} + 120 X^{4} Y^{4} Z^{4} + 10 X^{2} Y^{8} Z^{2} + 4 X^{2} Y^{3} Z^{6} + 4 X Y Z^{9} + 35 X^{6} Y^{2} Z^{2} + 30 X^{4} Y^{4} Z^{2} + 20 X^{2} Y^{6} Z^{2} + 58 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{3} Z^{4} + 60 X^{4} Y^{2} Z^{2} + 70 X^{2} Y^{4} Z^{2} + 154 X^{2} Y^{2} Z^{4} + 4 X Y^{4} Z^{3} + 16 X Y Z^{6} + 14 X^{3} Y Z^{3} + 24 X^{2} Y^{3} Z^{2} + 12 X^{2} Y^{2} Z^{3} + 12 X Y^{4} Z^{2} + 8 X Y^{3} Z^{3} + 42 X^{3} Y Z^{2} + 344 X^{2} Y^{2} Z^{2} + 24 X^{2} Y Z^{3} + 24 X Y^{4} Z + 24 X Y^{3} Z^{2} + 28 X Y^{2} Z^{3} + 12 X Y Z^{4} + 84 X^{3} Y Z + 72 X^{2} Y^{2} Z + 72 X^{2} Y Z^{2} + 48 X Y^{3} Z + 84 X Y^{2} Z^{2} + 32 X Y Z^{3} + 144 X^{2} Y Z + 168 X Y^{2} Z + 48 X Y Z^{2} + 48 X Y Z

Algorithm definition

The algorithm ⟨9×14×25:1975⟩ is the (Kronecker) tensor product of ⟨3×2×5:25⟩ with ⟨3×7×5:79⟩.

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