Description of fast matrix multiplication algorithm: ⟨8×28×32:4186⟩

Algorithm type

30 X^{8} Y^{8} Z^{8} + 10 X^{4} Y^{12} Z^{4} + 112 X^{4} Y^{8} Z^{4} + 24 X^{2} Y^{12} Z^{2} + 24 X Y^{12} Z + 266 X^{4} Y^{4} Z^{4} + 168 X^{2} Y^{8} Z^{2} + 24 X Y^{9} Z + 144 X^{2} Y^{6} Z^{2} + 96 X Y^{8} Z + 480 X^{2} Y^{4} Z^{2} + 120 X Y^{6} Z + 792 X^{2} Y^{2} Z^{2} + 216 X Y^{4} Z + 264 X Y^{3} Z + 696 X Y^{2} Z + 720 X Y Z

Algorithm definition

The algorithm ⟨8×28×32:4186⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ 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