Description of fast matrix multiplication algorithm: ⟨6×16×28:1716⟩

Algorithm type

12 X^{4} Y^{6} Z^{4} + 6 X^{4} Y^{4} Z^{6} + 2 X Y^{12} Z + 4 X^{2} Y^{9} Z^{2} + 90 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{8} Z^{2} + 2 X^{2} Y^{6} Z^{3} + 8 X Y^{9} Z + 70 X^{2} Y^{6} Z^{2} + 8 X Y^{8} Z + 8 X^{2} Y^{4} Z^{3} + 204 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 60 X Y^{6} Z + 20 X^{2} Y^{3} Z^{2} + 10 X^{2} Y^{2} Z^{3} + 300 X^{2} Y^{2} Z^{2} + 122 X Y^{4} Z + 8 X Y^{3} Z^{2} + 90 X Y^{3} Z + 32 X Y^{2} Z^{2} + 340 X Y^{2} Z + 40 X Y Z^{2} + 250 X Y Z

Algorithm definition

The algorithm ⟨6×16×28:1716⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨3×4×7:66⟩.

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