Description of fast matrix multiplication algorithm: ⟨18×27×30:7720⟩

Algorithm type

80 X^{6} Y^{6} Z^{6} + 1152 X^{4} Y^{6} Z^{6} + 16 X^{6} Y^{6} Z^{3} + 120 X^{3} Y^{6} Z^{6} + 16 X^{2} Y^{9} Z^{3} + 1744 X^{2} Y^{6} Z^{6} + 32 X^{4} Y^{6} Z^{3} + 16 X^{4} Y^{3} Z^{6} + 24 X Y^{9} Z^{3} + 24 X Y^{6} Z^{6} + 64 X^{6} Y^{3} Z^{3} + 24 X^{3} Y^{6} Z^{3} + 512 X^{2} Y^{6} Z^{3} + 280 X^{2} Y^{3} Z^{6} + 512 X^{4} Y^{3} Z^{3} + 696 X Y^{6} Z^{3} + 384 X Y^{3} Z^{6} + 96 X^{3} Y^{3} Z^{3} + 1232 X^{2} Y^{3} Z^{3} + 696 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨18×27×30:7720⟩ is the (Kronecker) tensor product of ⟨6×9×5:193⟩ 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