Description of fast matrix multiplication algorithm: ⟨10×24×28:3900⟩

Algorithm type

6 X^{6} Y^{4} Z^{4} + 354 X^{4} Y^{4} Z^{4} + 2 X^{3} Y^{6} Z^{2} + 12 X^{6} Y^{2} Z^{2} + 12 X^{4} Y^{4} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 118 X^{2} Y^{6} Z^{2} + 8 X^{3} Y^{4} Z^{2} + 4 X^{2} Y^{6} Z + 96 X^{4} Y^{2} Z^{2} + 634 X^{2} Y^{4} Z^{2} + 120 X^{2} Y^{2} Z^{4} + 54 X Y^{6} Z + 4 X^{3} Y^{3} Z + 10 X^{3} Y^{2} Z^{2} + 16 X^{2} Y^{4} Z + 2 X^{2} Y^{3} Z^{2} + 16 X^{3} Y^{2} Z + 32 X^{2} Y^{3} Z + 730 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 40 X Y^{3} Z^{2} + 20 X^{3} Y Z + 148 X^{2} Y^{2} Z + 10 X^{2} Y Z^{2} + 44 X Y^{3} Z + 160 X Y^{2} Z^{2} + 160 X^{2} Y Z + 446 X Y^{2} Z + 200 X Y Z^{2} + 220 X Y Z

Algorithm definition

The algorithm ⟨10×24×28:3900⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨5×6×7:150⟩.

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