Description of fast matrix multiplication algorithm: ⟨4×12×18:585⟩

Algorithm type

3 X^{4} Y^{8} Z^{4} + 12 X^{4} Y^{6} Z^{4} + 12 X^{4} Y^{4} Z^{4} + 18 X^{2} Y^{8} Z^{2} + 48 X^{2} Y^{6} Z^{2} + 24 X Y^{8} Z + 48 X^{2} Y^{4} Z^{2} + 48 X Y^{6} Z + 24 X^{2} Y^{3} Z^{2} + 60 X^{2} Y^{2} Z^{2} + 60 X Y^{4} Z + 48 X Y^{3} Z + 108 X Y^{2} Z + 72 X Y Z

Algorithm definition

The algorithm ⟨4×12×18:585⟩ is the (Kronecker) tensor product of ⟨2×3×3:15⟩ with ⟨2×4×6:39⟩.

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