Description of fast matrix multiplication algorithm: ⟨9×28×28:3969⟩

Algorithm type

4 X Y^{16} Z + 36 X^{4} Y^{9} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 180 X^{4} Y^{6} Z^{4} + 48 X Y^{12} Z + 144 X^{2} Y^{9} Z^{2} + 225 X^{4} Y^{4} Z^{4} + 60 X^{2} Y^{8} Z^{2} + 72 X^{4} Y^{3} Z^{4} + 144 X Y^{9} Z + 180 X^{4} Y^{2} Z^{4} + 504 X^{2} Y^{6} Z^{2} + 48 X Y^{8} Z + 36 X^{4} Y Z^{4} + 384 X^{2} Y^{4} Z^{2} + 288 X Y^{6} Z + 264 X^{2} Y^{3} Z^{2} + 444 X^{2} Y^{2} Z^{2} + 184 X Y^{4} Z + 120 X^{2} Y Z^{2} + 240 X Y^{3} Z + 240 X Y^{2} Z + 100 X Y Z

Algorithm definition

The algorithm ⟨9×28×28:3969⟩ is the (Kronecker) tensor product of ⟨3×4×7:63⟩ with ⟨3×7×4:63⟩.

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