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

Algorithm type

800 X^{4} Y^{4} Z^{4} + 48 X^{6} Y^{2} Z^{2} + 16 X^{4} Y^{2} Z^{4} + 25 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{4} + 32 X^{2} Y^{2} Z^{6} + 10 X^{2} Y^{4} Z^{3} + 256 X^{4} Y^{2} Z^{2} + 288 X^{2} Y^{4} Z^{2} + 250 X^{2} Y^{2} Z^{4} + 6 X Y^{3} Z^{4} + 2 X^{3} Y^{3} Z + 2 X^{2} Y^{2} Z^{3} + 14 X Y^{4} Z^{2} + 5 X Y^{3} Z^{3} + 8 X^{2} Y^{3} Z + 1936 X^{2} Y^{2} Z^{2} + 4 X Y^{4} Z + X Y^{3} Z^{2} + 13 X Y Z^{4} + 96 X^{3} Y Z + 32 X^{2} Y Z^{2} + 43 X Y^{3} Z + 44 X Y^{2} Z^{2} + 69 X Y Z^{3} + 512 X^{2} Y Z + 576 X Y^{2} Z + 457 X Y Z^{2} + 672 X Y Z

Algorithm definition

The algorithm ⟨20×24×24:6237⟩ is serendipitous tensor product (⟨5×6×6:130⟩ - 3) ⊗ ⟨4×4×4:48⟩ +⟨4×4×12:141⟩.

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