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

Algorithm type

96 X^{8} Y^{12} Z^{12} + 144 X^{4} Y^{12} Z^{12} + 32 X^{8} Y^{9} Z^{9} + 48 X^{4} Y^{12} Z^{6} + 48 X^{4} Y^{9} Z^{9} + 72 X^{2} Y^{12} Z^{6} + 256 X^{4} Y^{9} Z^{6} + 384 X^{2} Y^{9} Z^{6} + 688 X^{4} Y^{6} Z^{6} + 288 X^{2} Y^{9} Z^{3} + 1032 X^{2} Y^{6} Z^{6} + 32 X^{4} Y^{6} Z^{3} + 32 X^{4} Y^{3} Z^{6} + 432 X Y^{9} Z^{3} + 720 X^{2} Y^{6} Z^{3} + 48 X^{2} Y^{3} Z^{6} + 416 X^{4} Y^{3} Z^{3} + 1008 X Y^{6} Z^{3} + 1520 X^{2} Y^{3} Z^{3} + 1344 X Y^{3} Z^{3}

Algorithm definition

The algorithm ⟨18×30×30:8640⟩ is the (Kronecker) tensor product of ⟨6×10×5:216⟩ 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