Description of fast matrix multiplication algorithm: ⟨6×28×28:2835⟩

Algorithm type

6 X^{4} Y^{12} Z^{4} + 2 X^{2} Y^{16} Z^{2} + 8 X Y^{16} Z + 6 X^{4} Y^{9} Z^{4} + 15 X^{4} Y^{8} Z^{4} + 38 X^{2} Y^{12} Z^{2} + 69 X^{4} Y^{6} Z^{4} + 60 X Y^{12} Z + 48 X^{2} Y^{9} Z^{2} + 141 X^{4} Y^{4} Z^{4} + 90 X^{2} Y^{8} Z^{2} + 6 X^{4} Y^{3} Z^{4} + 72 X Y^{9} Z + 54 X^{4} Y^{2} Z^{4} + 222 X^{2} Y^{6} Z^{2} + 52 X Y^{8} Z + 172 X^{2} Y^{4} Z^{2} + 96 X Y^{6} Z + 178 X^{2} Y^{3} Z^{2} + 432 X^{2} Y^{2} Z^{2} + 108 X Y^{4} Z + 132 X^{2} Y Z^{2} + 324 X Y^{3} Z + 284 X Y^{2} Z + 220 X Y Z

Algorithm definition

The algorithm ⟨6×28×28:2835⟩ is the (Kronecker) tensor product of ⟨2×4×7:45⟩ 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