Description of fast matrix multiplication algorithm: ⟨8×16×26:2080⟩

Algorithm type

12 X^{6} Y^{8} Z^{6} + 4 X^{6} Y^{7} Z^{6} + 8 X^{3} Y^{12} Z^{3} + 8 X^{3} Y^{11} Z^{3} + 16 X Y^{12} Z + 118 X^{4} Y^{4} Z^{4} + 16 X^{2} Y^{8} Z^{2} + 6 X^{4} Y^{4} Z^{3} + 2 X^{4} Y^{3} Z^{4} + 2 X^{4} Y^{3} Z^{3} + 44 X^{3} Y^{4} Z^{3} + 120 X^{2} Y^{6} Z^{2} + 4 X^{3} Y^{3} Z^{3} + 8 X^{2} Y^{5} Z^{2} + 614 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 22 X^{2} Y^{2} Z + 2 X^{2} Y Z^{2} + 256 X Y^{3} Z + 2 X^{2} Y Z + 752 X Y Z

Algorithm definition

The algorithm ⟨8×16×26:2080⟩ is the projection [[0, 0], [27]] of ⟨8×16×27:2080⟩.

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