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

Algorithm type

16 X^{4} Y^{15} Z^{6} + 24 X^{2} Y^{15} Z^{6} + 64 X^{4} Y^{12} Z^{6} + 32 X^{2} Y^{15} Z^{3} + 96 X^{2} Y^{12} Z^{6} + 16 X^{4} Y^{12} Z^{3} + 32 X^{4} Y^{9} Z^{6} + 48 X Y^{15} Z^{3} + 88 X^{2} Y^{12} Z^{3} + 48 X^{2} Y^{9} Z^{6} + 64 X^{4} Y^{9} Z^{3} + 256 X^{4} Y^{6} Z^{6} + 96 X Y^{12} Z^{3} + 128 X^{2} Y^{9} Z^{3} + 384 X^{2} Y^{6} Z^{6} + 16 X^{4} Y^{6} Z^{3} + 32 X^{4} Y^{3} Z^{6} + 48 X Y^{9} Z^{3} + 200 X^{2} Y^{6} Z^{3} + 80 X^{2} Y^{3} Z^{6} + 16 X^{4} Y^{3} Z^{3} + 264 X Y^{6} Z^{3} + 48 X Y^{3} Z^{6} + 488 X^{2} Y^{3} Z^{3} + 696 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨9×21×30:3280⟩ is the (Kronecker) tensor product of ⟨3×7×5:82⟩ 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