Description of fast matrix multiplication algorithm: ⟨6×8×26:819⟩

Algorithm type

6 X^{4} Y^{6} Z^{4} + 33 X^{4} Y^{4} Z^{4} + 2 X^{2} Y^{8} Z^{2} + 6 X^{4} Y^{2} Z^{4} + 12 X^{2} Y^{6} Z^{2} + 30 X^{2} Y^{4} Z^{2} + 18 X^{2} Y^{2} Z^{4} + 36 X^{2} Y^{3} Z^{2} + 208 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 36 X^{2} Y Z^{2} + 72 X Y^{3} Z + 180 X Y^{2} Z + 108 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨6×8×26:819⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×4×13:117⟩.

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