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

Algorithm type

210 X^{4} Y^{4} Z^{4} + 16 X Y^{9} Z + 63 X^{6} Y^{2} Z^{2} + 42 X^{4} Y^{4} Z^{2} + 122 X^{2} Y^{6} Z^{2} + 42 X^{2} Y^{4} Z^{4} + 63 X^{2} Y^{2} Z^{6} + 16 X^{2} Y^{6} Z + 16 X Y^{6} Z^{2} + 21 X^{4} Y^{2} Z^{2} + 371 X^{2} Y^{4} Z^{2} + 21 X^{2} Y^{2} Z^{4} + 116 X Y^{6} Z + 24 X^{3} Y^{3} Z + 28 X^{2} Y^{4} Z + 28 X Y^{4} Z^{2} + 24 X Y^{3} Z^{3} + 42 X^{3} Y^{2} Z + 8 X^{2} Y^{3} Z + 403 X^{2} Y^{2} Z^{2} + 154 X Y^{4} Z + 8 X Y^{3} Z^{2} + 42 X Y^{2} Z^{3} + 102 X^{3} Y Z + 82 X^{2} Y^{2} Z + 92 X Y^{3} Z + 82 X Y^{2} Z^{2} + 102 X Y Z^{3} + 34 X^{2} Y Z + 416 X Y^{2} Z + 34 X Y Z^{2} + 102 X Y Z

Algorithm definition

The algorithm ⟨6×28×28:2926⟩ is the (Kronecker) tensor product of ⟨2×7×7:77⟩ with ⟨3×4×4:38⟩.

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