Description of fast matrix multiplication algorithm: ⟨12×30×32:6295⟩

Algorithm type

720 X^{4} Y^{6} Z^{6} + 1080 X^{2} Y^{6} Z^{6} + 135 X^{4} Y^{4} Z^{4} + 320 X^{2} Y^{6} Z^{3} + 320 X^{4} Y^{3} Z^{3} + 480 X Y^{6} Z^{3} + 20 X^{4} Y^{3} Z^{2} + 20 X^{3} Y^{4} Z^{2} + 410 X^{4} Y^{2} Z^{2} + 100 X^{3} Y^{3} Z^{2} + 140 X^{2} Y^{4} Z^{2} + 480 X^{2} Y^{3} Z^{3} + 20 X^{4} Y^{2} Z + 60 X^{3} Y^{2} Z^{2} + 20 X^{2} Y^{4} Z + 40 X^{2} Y^{3} Z^{2} + 180 X^{4} Y Z + 120 X^{3} Y^{2} Z + 100 X^{2} Y^{3} Z + 410 X^{2} Y^{2} Z^{2} + 60 X Y^{4} Z + 120 X^{3} Y Z + 300 X^{2} Y^{2} Z + 100 X Y^{3} Z + 260 X^{2} Y Z + 280 X Y^{2} Z

Algorithm definition

The algorithm ⟨12×30×32:6295⟩ is serendipitous tensor product (⟨4×10×4:115⟩ - 30) ⊗ ⟨3×3×8:55⟩ +15⟨3×6×8:108⟩.

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