Description of fast matrix multiplication algorithm: ⟨12×20×30:4104⟩

Algorithm type

18 X^{4} Y^{6} Z^{4} + 72 X^{8} Y^{2} Z^{2} + 414 X^{4} Y^{4} Z^{4} + 72 X^{2} Y^{2} Z^{8} + 252 X^{2} Y^{6} Z^{2} + 144 X^{2} Y^{4} Z^{4} + 72 X Y Z^{8} + 18 X^{2} Y^{3} Z^{4} + 486 X^{2} Y^{4} Z^{2} + 486 X^{2} Y^{2} Z^{4} + 234 X Y^{6} Z + 72 X^{4} Y^{2} Z + 72 X^{4} Y Z^{2} + 144 X Y^{4} Z^{2} + 216 X Y^{2} Z^{4} + 270 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 234 X Y^{3} Z^{2} + 72 X Y Z^{4} + 144 X Y^{2} Z^{2} + 270 X Y^{2} Z + 270 X Y Z^{2}

Algorithm definition

The algorithm ⟨12×20×30:4104⟩ is the (Kronecker) tensor product of ⟨3×4×6:54⟩ with ⟨4×5×5:76⟩.

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