Description of fast matrix multiplication algorithm: ⟨8×20×24:2352⟩

Algorithm type

X^{8} Y^{16} Z^{8} + 5 X^{8} Y^{12} Z^{8} + X^{4} Y^{20} Z^{4} + 6 X^{8} Y^{8} Z^{8} + 6 X^{4} Y^{16} Z^{4} + 8 X^{4} Y^{12} Z^{4} + 20 X^{4} Y^{8} Z^{4} + 60 X^{4} Y^{6} Z^{4} + 12 X^{2} Y^{10} Z^{2} + 85 X^{4} Y^{4} Z^{4} + 72 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{6} Z^{2} + 132 X^{2} Y^{4} Z^{2} + 180 X^{2} Y^{3} Z^{2} + 36 X Y^{5} Z + 372 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 288 X Y^{3} Z + 288 X Y^{2} Z + 468 X Y Z

Algorithm definition

The algorithm ⟨8×20×24:2352⟩ is the (Kronecker) tensor product of ⟨2×5×6:48⟩ with ⟨4×4×4:49⟩.

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