Description of fast matrix multiplication algorithm: ⟨18×21×27:5640⟩

Algorithm type

96 X^{6} Y^{6} Z^{6} + 672 X^{6} Y^{4} Z^{6} + 144 X^{6} Y^{3} Z^{6} + 96 X^{9} Y^{2} Z^{3} + 1008 X^{6} Y^{2} Z^{6} + 48 X^{3} Y^{8} Z^{3} + 96 X^{3} Y^{2} Z^{9} + 144 X^{9} Y Z^{3} + 192 X^{6} Y^{4} Z^{3} + 144 X^{3} Y Z^{9} + 176 X^{3} Y^{6} Z^{3} + 704 X^{6} Y^{2} Z^{3} + 624 X^{6} Y Z^{3} + 472 X^{3} Y^{4} Z^{3} + 264 X^{3} Y^{3} Z^{3} + 664 X^{3} Y^{2} Z^{3} + 96 X^{3} Y Z^{3}

Algorithm definition

The algorithm ⟨18×21×27:5640⟩ is the (Kronecker) tensor product of ⟨3×7×9:141⟩ with ⟨6×3×3: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