Description of fast matrix multiplication algorithm: ⟨9×30×31:4910⟩

Algorithm type

64 X^{2} Y^{12} Z^{3} + 32 X^{2} Y^{6} Z^{9} + 544 X^{4} Y^{6} Z^{6} + 96 X Y^{12} Z^{3} + 48 X Y^{6} Z^{9} + 32 X^{6} Y^{6} Z^{3} + 32 X^{2} Y^{9} Z^{3} + 880 X^{2} Y^{6} Z^{6} + 160 X^{2} Y^{3} Z^{9} + 64 X^{4} Y^{6} Z^{3} + 48 X Y^{9} Z^{3} + 96 X Y^{6} Z^{6} + 240 X Y^{3} Z^{9} + 160 X^{6} Y^{3} Z^{3} + 48 X^{3} Y^{6} Z^{3} + 512 X^{2} Y^{6} Z^{3} + 32 X^{2} Y^{3} Z^{6} + 32 X^{4} Y^{3} Z^{3} + 624 X Y^{6} Z^{3} + 48 X Y^{3} Z^{6} + 240 X^{3} Y^{3} Z^{3} + 272 X^{2} Y^{3} Z^{3} + 336 X Y^{3} Z^{3} + 270 X Y Z

Algorithm definition

The algorithm ⟨9×30×31:4910⟩ is the (Kronecker) tensor product of ⟨9×15×31:2455⟩ with ⟨1×2×1:2⟩.

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