Description of fast matrix multiplication algorithm: ⟨24×27×30:10200⟩

Algorithm type

112 X^{12} Y^{8} Z^{12} + 168 X^{12} Y^{4} Z^{12} + 64 X^{12} Y^{6} Z^{9} + 96 X^{12} Y^{3} Z^{9} + 32 X^{6} Y^{12} Z^{6} + 64 X^{6} Y^{10} Z^{6} + 352 X^{6} Y^{8} Z^{6} + 32 X^{6} Y^{10} Z^{3} + 112 X^{6} Y^{6} Z^{6} + 32 X^{3} Y^{12} Z^{3} + 96 X^{6} Y^{5} Z^{6} + 1232 X^{6} Y^{4} Z^{6} + 96 X^{3} Y^{10} Z^{3} + 96 X^{6} Y^{3} Z^{6} + 48 X^{6} Y^{5} Z^{3} + 1120 X^{6} Y^{2} Z^{6} + 384 X^{3} Y^{8} Z^{3} + 96 X^{6} Y Z^{6} + 176 X^{3} Y^{6} Z^{3} + 32 X^{6} Y^{2} Z^{3} + 144 X^{3} Y^{5} Z^{3} + 48 X^{6} Y Z^{3} + 1632 X^{3} Y^{4} Z^{3} + 192 X^{3} Y^{3} Z^{3} + 2448 X^{3} Y^{2} Z^{3} + 1296 X^{3} Y Z^{3}

Algorithm definition

The algorithm ⟨24×27×30:10200⟩ is the (Kronecker) tensor product of ⟨4×9×10:255⟩ 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