Description of fast matrix multiplication algorithm: ⟨20×21×24:5616⟩

Algorithm type

648 X^{4} Y^{4} Z^{4} + 36 X^{4} Y^{4} Z^{2} + 360 X^{4} Y^{2} Z^{2} + 936 X^{2} Y^{4} Z^{2} + 792 X^{2} Y^{2} Z^{4} + 36 X^{2} Y^{4} Z + 432 X^{2} Y^{2} Z^{2} + 288 X Y^{4} Z + 144 X Y Z^{4} + 360 X^{2} Y^{2} Z + 360 X^{2} Y Z^{2} + 432 X Y^{2} Z^{2} + 396 X Y^{2} Z + 396 X Y Z^{2}

Algorithm definition

The algorithm ⟨20×21×24:5616⟩ is the (Kronecker) tensor product of ⟨4×3×6:54⟩ with ⟨5×7×4:104⟩.

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