Description of fast matrix multiplication algorithm: ⟨8×21×32:3220⟩

Algorithm type

20 X^{8} Y^{8} Z^{8} + 20 X^{4} Y^{12} Z^{4} + 48 X^{4} Y^{8} Z^{4} + 48 X^{2} Y^{12} Z^{2} + 48 X Y^{12} Z + 204 X^{4} Y^{4} Z^{4} + 48 X^{2} Y^{8} Z^{2} + 48 X Y^{9} Z + 192 X^{2} Y^{6} Z^{2} + 192 X^{2} Y^{4} Z^{2} + 48 X Y^{6} Z + 720 X^{2} Y^{2} Z^{2} + 144 X Y^{4} Z + 432 X Y^{3} Z + 144 X Y^{2} Z + 864 X Y Z

Algorithm definition

The algorithm ⟨8×21×32:3220⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ with ⟨4×7×8:161⟩.

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