Description of fast matrix multiplication algorithm: ⟨18×24×27:6400⟩

Algorithm type

48 X^{12} Y^{12} Z^{8} + 72 X^{12} Y^{12} Z^{4} + 32 X^{12} Y^{9} Z^{6} + 48 X^{12} Y^{9} Z^{3} + 16 X^{6} Y^{6} Z^{10} + 80 X^{6} Y^{6} Z^{8} + 16 X^{6} Y^{3} Z^{10} + 16 X^{6} Y^{6} Z^{6} + 24 X^{6} Y^{6} Z^{5} + 696 X^{6} Y^{6} Z^{4} + 24 X^{6} Y^{6} Z^{3} + 896 X^{6} Y^{6} Z^{2} + 24 X^{6} Y^{3} Z^{5} + 48 X^{6} Y^{6} Z + 288 X^{3} Y^{3} Z^{6} + 16 X^{6} Y^{3} Z^{2} + 24 X^{6} Y^{3} Z + 288 X^{3} Y^{3} Z^{4} + 432 X^{3} Y^{3} Z^{3} + 1584 X^{3} Y^{3} Z^{2} + 1728 X^{3} Y^{3} Z

Algorithm definition

The algorithm ⟨18×24×27:6400⟩ is the (Kronecker) tensor product of ⟨3×6×3:40⟩ with ⟨6×4×9:160⟩.

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