Description of fast matrix multiplication algorithm: ⟨4×9×22:550⟩

Algorithm type

10 X^{4} Y^{5} Z^{4} + 10 X^{4} Y^{4} Z^{4} + 4 X^{4} Y^{3} Z^{4} + 2 X^{2} Y^{6} Z^{2} + 38 X^{2} Y^{5} Z^{2} + 56 X^{2} Y^{4} Z^{2} + 16 X Y^{6} Z + 46 X^{2} Y^{3} Z^{2} + 56 X Y^{5} Z + 32 X^{2} Y^{2} Z^{2} + 34 X Y^{4} Z + 2 X Y^{3} Z^{2} + 10 X^{2} Y Z^{2} + 100 X Y^{3} Z + 72 X Y^{2} Z + 2 X Y Z^{2} + 60 X Y Z

Algorithm definition

The algorithm ⟨4×9×22:550⟩ is the (Kronecker) tensor product of ⟨4×9×11:275⟩ with ⟨1×1×2:2⟩.

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