Description of fast matrix multiplication algorithm: ⟨12×20×27:3744⟩

Algorithm type

36 X^{6} Y^{8} Z^{6} + 8 X^{9} Y^{4} Z^{3} + 24 X^{3} Y^{8} Z^{3} + 24 X^{6} Y^{4} Z^{3} + 288 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{8} Z^{2} + 64 X^{6} Y^{2} Z^{2} + 52 X^{3} Y^{4} Z^{3} + 24 X Y^{8} Z + 192 X^{4} Y^{2} Z^{2} + 8 X^{3} Y^{4} Z + 192 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{4} Z + 992 X^{2} Y^{2} Z^{2} + 52 X Y^{4} Z + 128 X^{3} Y Z + 384 X^{2} Y Z + 384 X Y^{2} Z + 832 X Y Z

Algorithm definition

The algorithm ⟨12×20×27:3744⟩ is the (Kronecker) tensor product of ⟨4×4×9:104⟩ with ⟨3×5×3:36⟩.

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