Description of fast matrix multiplication algorithm: ⟨4×18×25:1175⟩

Algorithm type

10 X^{4} Y^{8} Z^{4} + 4 X^{2} Y^{12} Z^{2} + 8 X Y^{12} Z + 55 X^{4} Y^{4} Z^{4} + 32 X^{2} Y^{8} Z^{2} + 16 X Y^{9} Z + 62 X^{2} Y^{6} Z^{2} + 24 X Y^{8} Z + 110 X^{2} Y^{4} Z^{2} + 56 X Y^{6} Z + 222 X^{2} Y^{2} Z^{2} + 72 X Y^{4} Z + 132 X Y^{3} Z + 156 X Y^{2} Z + 216 X Y Z

Algorithm definition

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

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