Description of fast matrix multiplication algorithm: ⟨4×20×28:1456⟩

Algorithm type

24 X^{4} Y^{6} Z^{4} + 10 X Y^{12} Z + 8 X^{2} Y^{9} Z^{2} + 60 X^{4} Y^{4} Z^{4} + 30 X^{2} Y^{8} Z^{2} + 22 X Y^{9} Z + 118 X^{2} Y^{6} Z^{2} + 40 X Y^{8} Z + 122 X^{2} Y^{4} Z^{2} + 102 X Y^{6} Z + 40 X^{2} Y^{3} Z^{2} + 214 X^{2} Y^{2} Z^{2} + 106 X Y^{4} Z + 148 X Y^{3} Z + 222 X Y^{2} Z + 190 X Y Z

Algorithm definition

The algorithm ⟨4×20×28:1456⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×5×7:56⟩.

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