Description of fast matrix multiplication algorithm: ⟨4×18×25:1200⟩

Algorithm type

2 X Y^{15} Z + 5 X^{4} Y^{8} Z^{4} + 2 X^{2} Y^{12} Z^{2} + 25 X^{4} Y^{6} Z^{4} + 5 X^{2} Y^{10} Z^{2} + 12 X Y^{12} Z + 10 X^{2} Y^{9} Z^{2} + 30 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{8} Z^{2} + 6 X Y^{10} Z + 16 X Y^{9} Z + 82 X^{2} Y^{6} Z^{2} + 36 X Y^{8} Z + 88 X^{2} Y^{4} Z^{2} + 64 X Y^{6} Z + 60 X^{2} Y^{3} Z^{2} + 12 X Y^{5} Z + 137 X^{2} Y^{2} Z^{2} + 120 X Y^{4} Z + 122 X Y^{3} Z + 174 X Y^{2} Z + 156 X Y Z

Algorithm definition

The algorithm ⟨4×18×25:1200⟩ is the (Kronecker) tensor product of ⟨2×3×5:25⟩ with ⟨2×6×5:48⟩.

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