Description of fast matrix multiplication algorithm: ⟨6×6×28:665⟩

Algorithm type

32 X^{4} Y^{6} Z^{6} + 48 X^{2} Y^{6} Z^{6} + 3 X^{4} Y^{4} Z^{4} + 6 X^{4} Y^{2} Z^{2} + 192 X^{2} Y^{3} Z^{3} + 288 X Y^{3} Z^{3} + 24 X^{2} Y^{2} Z^{2} + 36 X^{2} Y Z + 36 X Y Z

Algorithm definition

The algorithm ⟨6×6×28:665⟩ is the (Kronecker) tensor product of ⟨3×3×14:95⟩ with ⟨2×2×2:7⟩.

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