Description of fast matrix multiplication algorithm: ⟨4×5×24:366⟩

Algorithm type

3 X^{4} Y^{4} Z^{4} + 3 X^{4} Y^{3} Z^{4} + 3 X^{3} Y^{4} Z^{4} + 3 X^{3} Y^{3} Z^{4} + 9 X^{2} Y^{5} Z^{2} + 3 X Y^{5} Z^{2} + 81 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{2} + 36 X Y^{3} Z + 3 X Y^{2} Z^{2} + 216 X Y Z

Algorithm definition

The algorithm ⟨4×5×24:366⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨4×5×8:122⟩.

Algorithm description

maple tensor 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