Description of fast matrix multiplication algorithm: ⟨8×10×18:924⟩

Algorithm type

48 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + 3 X^{2} Y^{2} Z^{6} + 9 X^{4} Y^{2} Z^{2} + 22 X^{2} Y^{4} Z^{2} + 18 X^{2} Y^{2} Z^{4} + 316 X^{2} Y^{2} Z^{2} + 12 X Y^{3} Z + 12 X Y^{2} Z^{2} + 18 X Y Z^{3} + 54 X^{2} Y Z + 132 X Y^{2} Z + 108 X Y Z^{2} + 168 X Y Z

Algorithm definition

The algorithm ⟨8×10×18:924⟩ is the (Kronecker) tensor product of ⟨4×5×9:132⟩ with ⟨2×2×2:7⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP 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