Description of fast matrix multiplication algorithm: ⟨4×5×30:438⟩

Algorithm type

162 X^{2} Y^{2} Z^{2} + 3 X Y^{2} Z^{3} + 9 X Y^{3} Z + 15 X Y^{2} Z^{2} + 3 X Y Z^{3} + 24 X^{2} Y Z + 81 X Y^{2} Z + 69 X Y Z^{2} + 72 X Y Z

Algorithm definition

The algorithm ⟨4×5×30:438⟩ is the (Kronecker) tensor product of ⟨1×1×3:3⟩ with ⟨4×5×10:146⟩.

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