Description of fast matrix multiplication algorithm: ⟨6×21×29:2200⟩

Algorithm type

32 X^{4} Y^{15} Z^{6} + 48 X^{2} Y^{15} Z^{6} + 32 X^{4} Y^{12} Z^{6} + 96 X^{2} Y^{15} Z^{3} + 48 X^{2} Y^{12} Z^{6} + 16 X^{4} Y^{9} Z^{6} + 144 X Y^{15} Z^{3} + 112 X^{2} Y^{12} Z^{3} + 24 X^{2} Y^{9} Z^{6} + 160 X^{4} Y^{6} Z^{6} + 168 X Y^{12} Z^{3} + 64 X^{2} Y^{9} Z^{3} + 240 X^{2} Y^{6} Z^{6} + 16 X^{4} Y^{3} Z^{6} + 96 X Y^{9} Z^{3} + 96 X^{2} Y^{6} Z^{3} + 24 X^{2} Y^{3} Z^{6} + 32 X^{4} Y^{3} Z^{3} + 144 X Y^{6} Z^{3} + 272 X^{2} Y^{3} Z^{3} + 336 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨6×21×29:2200⟩ is the projection [[0, 0], [30]] of ⟨6×21×30:2200⟩.

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