Description of fast matrix multiplication algorithm: ⟨4×24×28:1716⟩

Algorithm type

6 X Y^{18} Z + 8 X Y^{15} Z + 30 X^{4} Y^{8} Z^{4} + 28 X^{2} Y^{12} Z^{2} + 24 X^{2} Y^{10} Z^{2} + 42 X Y^{12} Z + 78 X^{4} Y^{4} Z^{4} + 94 X^{2} Y^{8} Z^{2} + 32 X Y^{10} Z + 14 X Y^{9} Z + 12 X^{4} Y^{2} Z^{4} + 68 X^{2} Y^{6} Z^{2} + 72 X Y^{8} Z + 190 X^{2} Y^{4} Z^{2} + 98 X Y^{6} Z + 4 X^{2} Y^{3} Z^{2} + 40 X Y^{5} Z + 248 X^{2} Y^{2} Z^{2} + 138 X Y^{4} Z + 20 X^{2} Y Z^{2} + 104 X Y^{3} Z + 196 X Y^{2} Z + 170 X Y Z

Algorithm definition

The algorithm ⟨4×24×28:1716⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×6×7:66⟩.

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