Description of fast matrix multiplication algorithm: ⟨14×16×32:4186⟩

Algorithm type

30 X^{8} Y^{8} Z^{8} + 2 X^{4} Y^{12} Z^{8} + 8 X^{4} Y^{12} Z^{4} + 8 X^{4} Y^{8} Z^{8} + 32 X^{4} Y^{8} Z^{4} + 46 X^{4} Y^{4} Z^{8} + 6 X^{2} Y^{6} Z^{8} + 2 X^{2} Y^{6} Z^{6} + 12 X^{2} Y^{4} Z^{8} + 292 X^{4} Y^{4} Z^{4} + 16 X^{2} Y^{6} Z^{4} + 20 X^{2} Y^{4} Z^{6} + 24 X^{2} Y^{2} Z^{8} + 72 X^{2} Y^{6} Z^{2} + 64 X^{2} Y^{4} Z^{4} + 16 X^{2} Y^{2} Z^{6} + 288 X^{2} Y^{4} Z^{2} + 296 X^{2} Y^{2} Z^{4} + 36 X Y^{3} Z^{4} + 12 X Y^{3} Z^{3} + 72 X Y^{2} Z^{4} + 792 X^{2} Y^{2} Z^{2} + 24 X Y^{3} Z^{2} + 120 X Y^{2} Z^{3} + 144 X Y Z^{4} + 144 X Y^{3} Z + 96 X Y^{2} Z^{2} + 96 X Y Z^{3} + 576 X Y^{2} Z + 120 X Y Z^{2} + 720 X Y Z

Algorithm definition

The algorithm ⟨14×16×32:4186⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨7×8×16:598⟩.

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