Description of fast matrix multiplication algorithm: ⟨12×20×28:3782⟩

Algorithm type

32 X^{4} Y^{6} Z^{4} + 384 X^{4} Y^{4} Z^{4} + 32 X^{2} Y^{8} Z^{2} + 32 X^{6} Y^{2} Z^{2} + 64 X^{2} Y^{6} Z^{2} + 96 X^{2} Y^{4} Z^{4} + 104 X^{2} Y^{2} Z^{6} + 32 X^{4} Y^{2} Z^{2} + 224 X^{2} Y^{4} Z^{2} + 226 X^{2} Y^{2} Z^{4} + 24 X Y Z^{6} + 64 X^{2} Y^{3} Z^{2} + 816 X^{2} Y^{2} Z^{2} + 64 X Y^{4} Z + 46 X Y^{2} Z^{3} + 33 X Y Z^{4} + 64 X^{3} Y Z + 128 X Y^{3} Z + 192 X Y^{2} Z^{2} + 143 X Y Z^{3} + 64 X^{2} Y Z + 462 X Y^{2} Z + 386 X Y Z^{2} + 70 X Y Z

Algorithm definition

The algorithm ⟨12×20×28:3782⟩ is serendipitous tensor product (⟨3×5×7:79⟩ - 5) ⊗ ⟨4×4×4:48⟩ +⟨4×4×20:230⟩.

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