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

Algorithm type

90 X^{4} Y^{4} Z^{4} + 36 X^{2} Y^{6} Z^{2} + 90 X^{4} Y^{2} Z^{2} + 198 X^{2} Y^{4} Z^{2} + 36 X Y^{6} Z + 36 X^{2} Y^{3} Z + 216 X^{2} Y^{2} Z^{2} + 108 X Y^{4} Z + 108 X^{2} Y^{2} Z + 216 X^{2} Y Z + 216 X Y^{2} Z

Algorithm definition

The algorithm ⟨6×18×20:1350⟩ is the (Kronecker) tensor product of ⟨2×3×5:25⟩ with ⟨3×6×4:54⟩.

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