Description of fast matrix multiplication algorithm: ⟨4×16×28:1170⟩

Algorithm type

6 X^{4} Y^{8} Z^{4} + 2 X^{2} Y^{12} Z^{2} + 6 X^{4} Y^{6} Z^{4} + 8 X Y^{12} Z + 2 X^{2} Y^{9} Z^{2} + 54 X^{4} Y^{4} Z^{4} + 32 X^{2} Y^{8} Z^{2} + 12 X Y^{9} Z + 62 X^{2} Y^{6} Z^{2} + 32 X Y^{8} Z + 94 X^{2} Y^{4} Z^{2} + 52 X Y^{6} Z + 10 X^{2} Y^{3} Z^{2} + 222 X^{2} Y^{2} Z^{2} + 56 X Y^{4} Z + 104 X Y^{3} Z + 196 X Y^{2} Z + 220 X Y Z

Algorithm definition

The algorithm ⟨4×16×28:1170⟩ is the (Kronecker) tensor product of ⟨2×4×4:26⟩ with ⟨2×4×7:45⟩.

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