Description of fast matrix multiplication algorithm: ⟨4×10×16:441⟩

Algorithm type

X^{4} Y^{10} Z^{4} + 4 X^{4} Y^{8} Z^{4} + X^{4} Y^{6} Z^{4} + 7 X^{2} Y^{10} Z^{2} + 11 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{8} Z^{2} + 8 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{5} Z^{2} + 32 X^{2} Y^{4} Z^{2} + 6 X^{2} Y^{3} Z^{2} + 42 X Y^{5} Z + 83 X^{2} Y^{2} Z^{2} + 36 X Y^{4} Z + 48 X Y^{3} Z + 48 X Y^{2} Z + 102 X Y Z

Algorithm definition

The algorithm ⟨4×10×16:441⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×5×8:63⟩.

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