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

Algorithm type

12 X^{4} Y^{8} Z^{4} + 66 X^{4} Y^{4} Z^{4} + 24 X^{2} Y^{8} Z^{2} + 4 X^{2} Y^{4} Z^{6} + 48 X^{2} Y^{6} Z^{2} + 16 X^{2} Y^{4} Z^{4} + 22 X^{2} Y^{2} Z^{6} + 44 X^{2} Y^{4} Z^{2} + 88 X^{2} Y^{2} Z^{4} + 8 X Y^{4} Z^{3} + 32 X Y^{4} Z^{2} + 16 X Y^{3} Z^{3} + 218 X^{2} Y^{2} Z^{2} + 40 X Y^{4} Z + 64 X Y^{3} Z^{2} + 8 X Y^{2} Z^{3} + 80 X Y^{3} Z + 32 X Y^{2} Z^{2} + 36 X Y Z^{3} + 40 X Y^{2} Z + 144 X Y Z^{2} + 180 X Y Z

Algorithm definition

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

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