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

Algorithm type

4 X^{6} Y^{8} Z^{6} + 38 X^{4} Y^{4} Z^{4} + 4 X^{2} Y^{8} Z^{2} + 2 X^{6} Y^{2} Z^{2} + 24 X^{3} Y^{4} Z^{3} + 8 X^{4} Y^{2} Z^{2} + 302 X^{2} Y^{2} Z^{2} + 24 X Y^{4} Z + 12 X^{3} Y Z + 48 X^{2} Y Z + 444 X Y Z

Algorithm definition

The algorithm ⟨8×8×22:910⟩ is the (Kronecker) tensor product of ⟨4×4×11:130⟩ 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