Description of fast matrix multiplication algorithm: ⟨8×22×26:2800⟩

Algorithm type

16 X^{8} Y^{14} Z^{8} + 6 X^{8} Y^{8} Z^{8} + 16 X^{4} Y^{14} Z^{4} + 2 X^{4} Y^{12} Z^{4} + 48 X^{4} Y^{8} Z^{4} + 6 X^{2} Y^{12} Z^{2} + 96 X^{4} Y^{7} Z^{4} + 10 X^{4} Y^{6} Z^{4} + 6 X^{2} Y^{10} Z^{2} + 86 X^{4} Y^{4} Z^{4} + 46 X^{2} Y^{8} Z^{2} + 96 X^{2} Y^{7} Z^{2} + 12 X^{4} Y^{2} Z^{4} + 38 X^{2} Y^{6} Z^{2} + 360 X^{2} Y^{4} Z^{2} + 36 X Y^{6} Z + 60 X^{2} Y^{3} Z^{2} + 36 X Y^{5} Z + 384 X^{2} Y^{2} Z^{2} + 276 X Y^{4} Z + 72 X^{2} Y Z^{2} + 156 X Y^{3} Z + 432 X Y^{2} Z + 504 X Y Z

Algorithm definition

The algorithm ⟨8×22×26:2800⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×11×13:400⟩.

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