Description of fast matrix multiplication algorithm: ⟨4×5×25:380⟩

Algorithm type

5 X^{2} Y^{3} Z^{2} + 20 X^{4} Y Z + 115 X^{2} Y^{2} Z^{2} + 20 X Y Z^{4} + 65 X Y^{3} Z + 40 X Y^{2} Z^{2} + 20 X Y^{2} Z + 20 X Y Z^{2} + 75 X Y Z

Algorithm definition

The algorithm ⟨4×5×25:380⟩ is the (Kronecker) tensor product of ⟨1×1×5:5⟩ with ⟨4×5×5:76⟩.

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