Description of fast matrix multiplication algorithm: ⟨4×15×28:1120⟩

Algorithm type

16 X^{4} Y^{6} Z^{4} + 20 X Y^{12} Z + 16 X^{2} Y^{9} Z^{2} + 40 X^{4} Y^{4} Z^{4} + 20 X^{2} Y^{8} Z^{2} + 44 X Y^{9} Z + 84 X^{2} Y^{6} Z^{2} + 28 X^{2} Y^{4} Z^{2} + 28 X Y^{6} Z + 48 X^{2} Y^{3} Z^{2} + 196 X^{2} Y^{2} Z^{2} + 60 X Y^{4} Z + 208 X Y^{3} Z + 84 X Y^{2} Z + 228 X Y Z

Algorithm definition

The algorithm ⟨4×15×28:1120⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ 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