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

Algorithm type

X^{4} Y^{8} Z^{4} + X^{4} Y^{4} Z^{8} + 45 X^{4} Y^{4} Z^{4} + X^{2} Y^{6} Z^{4} + X^{2} Y^{4} Z^{6} + 2 X^{2} Y^{6} Z^{2} + 3 X^{2} Y^{2} Z^{6} + 2 X^{4} Y^{2} Z^{2} + 25 X^{2} Y^{4} Z^{2} + 24 X^{2} Y^{2} Z^{4} + 306 X^{2} Y^{2} Z^{2} + 6 X Y^{3} Z^{2} + 6 X Y^{2} Z^{3} + 12 X Y^{3} Z + 18 X Y Z^{3} + 12 X^{2} Y Z + 114 X Y^{2} Z + 108 X Y Z^{2} + 216 X Y Z

Algorithm definition

The algorithm ⟨8×8×22:903⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×4×11:129⟩.

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