Description of fast matrix multiplication algorithm: ⟨8×18×26:2303⟩

Algorithm type

9 X^{8} Y^{8} Z^{8} + 4 X^{6} Y^{8} Z^{6} + 36 X^{4} Y^{8} Z^{4} + 122 X^{4} Y^{4} Z^{4} + 40 X^{2} Y^{8} Z^{2} + 24 X^{3} Y^{4} Z^{3} + 288 X^{2} Y^{4} Z^{2} + 508 X^{2} Y^{2} Z^{2} + 240 X Y^{4} Z + 432 X Y^{2} Z + 600 X Y Z

Algorithm definition

The algorithm ⟨8×18×26:2303⟩ is the (Kronecker) tensor product of ⟨4×9×13:329⟩ with ⟨2×2×2:7⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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