Description of fast matrix multiplication algorithm: ⟨8×24×26:3010⟩

Algorithm type

15 X^{8} Y^{8} Z^{8} + 6 X^{8} Y^{6} Z^{6} + 9 X^{4} Y^{12} Z^{4} + 6 X^{4} Y^{10} Z^{4} + 3 X^{4} Y^{10} Z^{2} + 40 X^{4} Y^{8} Z^{4} + 14 X^{2} Y^{12} Z^{2} + 4 X^{4} Y^{6} Z^{4} + 6 X^{2} Y^{10} Z^{2} + 168 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{8} Z^{2} + 36 X^{4} Y^{3} Z^{3} + 6 X^{4} Y^{2} Z^{4} + 78 X^{2} Y^{6} Z^{2} + 36 X^{2} Y^{5} Z^{2} + 3 X^{4} Y^{2} Z^{2} + 18 X^{2} Y^{5} Z + 336 X^{2} Y^{4} Z^{2} + 84 X Y^{6} Z + 24 X^{2} Y^{3} Z^{2} + 36 X Y^{5} Z + 552 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 36 X^{2} Y Z^{2} + 144 X Y^{3} Z + 18 X^{2} Y Z + 576 X Y^{2} Z + 504 X Y Z

Algorithm definition

The algorithm ⟨8×24×26:3010⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×12×13:430⟩.

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