Description of fast matrix multiplication algorithm: ⟨20×20×28:6093⟩

Algorithm type

16 X^{6} Y^{4} Z^{4} + 752 X^{4} Y^{4} Z^{4} + 48 X^{6} Y^{2} Z^{2} + 16 X^{4} Y^{2} Z^{4} + 2 X^{2} Y^{4} Z^{4} + 8 X^{2} Y^{2} Z^{6} + 12 X^{2} Y^{3} Z^{4} + X Y^{2} Z^{6} + 144 X^{4} Y^{2} Z^{2} + 314 X^{2} Y^{4} Z^{2} + 2 X^{2} Y^{3} Z^{3} + 312 X^{2} Y^{2} Z^{4} + X Y^{4} Z^{3} + 3 X Y Z^{6} + 32 X^{3} Y^{2} Z^{2} + 13 X Y^{3} Z^{3} + 12 X Y^{2} Z^{4} + 1913 X^{2} Y^{2} Z^{2} + 5 X Y^{4} Z + 7 X Y^{2} Z^{3} + 9 X Y Z^{4} + 98 X^{3} Y Z + 32 X^{2} Y Z^{2} + 3 X Y^{3} Z + 2 X Y^{2} Z^{2} + 6 X Y Z^{3} + 296 X^{2} Y Z + 615 X Y^{2} Z + 608 X Y Z^{2} + 811 X Y Z

Algorithm definition

The algorithm ⟨20×20×28:6093⟩ is serendipitous tensor product (⟨5×5×7:127⟩ - 3) ⊗ ⟨4×4×4:48⟩ +⟨4×4×12:141⟩.

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