Description of fast matrix multiplication algorithm: ⟨8×20×32:3021⟩

Algorithm type

16 X^{4} Y^{10} Z^{4} + 64 X^{4} Y^{8} Z^{4} + 16 X^{4} Y^{6} Z^{4} + 112 X^{2} Y^{10} Z^{2} + 176 X^{4} Y^{4} Z^{4} + 96 X^{2} Y^{8} Z^{2} + 129 X^{2} Y^{6} Z^{2} + 41 X^{2} Y^{5} Z^{2} + 248 X^{2} Y^{4} Z^{2} + 2 X Y^{6} Z + 40 X^{2} Y^{3} Z^{2} + 232 X Y^{5} Z + 617 X^{2} Y^{2} Z^{2} + 207 X Y^{4} Z + 9 X Y^{3} Z^{2} + 2 X^{3} Y Z + 264 X Y^{3} Z + 18 X Y^{2} Z^{2} + 8 X^{2} Y Z + 197 X Y^{2} Z + 3 X Y Z^{2} + 524 X Y Z

Algorithm definition

The algorithm ⟨8×20×32:3021⟩ is serendipitous tensor product (⟨2×5×8:63⟩ - 19) ⊗ ⟨4×4×4:48⟩ +⟨4×4×12:141⟩ +8⟨4×4×8:96⟩.

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