Description of fast matrix multiplication algorithm: ⟨6×6×20:483⟩

Algorithm type

16 X^{4} Y^{6} Z^{6} + 24 X^{2} Y^{6} Z^{6} + 7 X^{4} Y^{4} Z^{4} + X^{6} Y^{2} Z^{2} + 2 X^{2} Y^{6} Z^{2} + 2 X^{2} Y^{4} Z^{4} + 2 X^{2} Y^{2} Z^{6} + 4 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{3} Z^{3} + 4 X^{2} Y^{2} Z^{4} + 144 X Y^{3} Z^{3} + 49 X^{2} Y^{2} Z^{2} + 6 X^{3} Y Z + 12 X Y^{3} Z + 12 X Y^{2} Z^{2} + 12 X Y Z^{3} + 24 X Y^{2} Z + 24 X Y Z^{2} + 42 X Y Z

Algorithm definition

The algorithm ⟨6×6×20:483⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×3×10:69⟩.

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