Description of fast matrix multiplication algorithm: ⟨20×20×24:5280⟩

Algorithm type

640 X^{4} Y^{4} Z^{4} + 32 X^{6} Y^{2} Z^{2} + 16 X^{4} Y^{2} Z^{4} + 48 X^{2} Y^{6} Z^{2} + 16 X^{2} Y^{4} Z^{4} + 48 X^{2} Y^{2} Z^{6} + 192 X^{4} Y^{2} Z^{2} + 224 X^{2} Y^{4} Z^{2} + 208 X^{2} Y^{2} Z^{4} + 1616 X^{2} Y^{2} Z^{2} + 64 X^{3} Y Z + 32 X^{2} Y Z^{2} + 96 X Y^{3} Z + 32 X Y^{2} Z^{2} + 96 X Y Z^{3} + 384 X^{2} Y Z + 448 X Y^{2} Z + 416 X Y Z^{2} + 672 X Y Z

Algorithm definition

The algorithm ⟨20×20×24:5280⟩ is the (Kronecker) tensor product of ⟨4×4×4:48⟩ with ⟨5×5×6:110⟩.

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