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

Algorithm type

300 X^{4} Y^{4} Z^{4} + 4 X Y^{9} Z + 18 X^{6} Y^{2} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 112 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{4} Z^{4} + 12 X^{2} Y^{2} Z^{6} + 2 X Y^{6} Z^{2} + 96 X^{4} Y^{2} Z^{2} + 508 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{2} Z^{4} + 52 X Y^{6} Z + 6 X^{3} Y^{3} Z + 2 X^{2} Y^{3} Z^{2} + 8 X Y^{4} Z^{2} + 4 X Y^{3} Z^{3} + 24 X^{3} Y^{2} Z + 32 X^{2} Y^{3} Z + 634 X^{2} Y^{2} Z^{2} + 144 X Y^{4} Z + 32 X Y^{3} Z^{2} + 16 X Y^{2} Z^{3} + 30 X^{3} Y Z + 128 X^{2} Y^{2} Z + 10 X^{2} Y Z^{2} + 62 X Y^{3} Z + 138 X Y^{2} Z^{2} + 20 X Y Z^{3} + 160 X^{2} Y Z + 348 X Y^{2} Z + 160 X Y Z^{2} + 210 X Y Z

Algorithm definition

The algorithm ⟨10×24×24:3380⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨5×6×6:130⟩.

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