Description of fast matrix multiplication algorithm: ⟨21×21×30:7040⟩

Algorithm type

16 X^{2} Y^{3} Z^{15} + 16 X^{4} Y^{9} Z^{6} + 24 X Y^{3} Z^{15} + 160 X^{6} Y^{6} Z^{6} + 24 X^{2} Y^{9} Z^{6} + 48 X^{2} Y^{3} Z^{12} + 928 X^{4} Y^{6} Z^{6} + 72 X Y^{3} Z^{12} + 240 X^{3} Y^{6} Z^{6} + 64 X^{2} Y^{9} Z^{3} + 1392 X^{2} Y^{6} Z^{6} + 16 X^{2} Y^{3} Z^{9} + 16 X^{4} Y^{6} Z^{3} + 112 X^{4} Y^{3} Z^{6} + 96 X Y^{9} Z^{3} + 24 X Y^{3} Z^{9} + 128 X^{6} Y^{3} Z^{3} + 328 X^{2} Y^{6} Z^{3} + 408 X^{2} Y^{3} Z^{6} + 400 X^{4} Y^{3} Z^{3} + 456 X Y^{6} Z^{3} + 360 X Y^{3} Z^{6} + 192 X^{3} Y^{3} Z^{3} + 968 X^{2} Y^{3} Z^{3} + 552 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨21×21×30:7040⟩ is the (Kronecker) tensor product of ⟨7×7×5:176⟩ with ⟨3×3×6:40⟩.

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