Description of fast matrix multiplication algorithm: ⟨2×7×18:198⟩

Algorithm type

4X2Y4Z2+4XY6Z+22X2Y3Z2+16XY5Z+28X2Y2Z2+16XY4Z+18XY3Z+22XY2Z+68XYZ4X2Y4Z24XY6Z22X2Y3Z216XY5Z28X2Y2Z216XY4Z18XY3Z22XY2Z68XYZ4*X^2*Y^4*Z^2+4*X*Y^6*Z+22*X^2*Y^3*Z^2+16*X*Y^5*Z+28*X^2*Y^2*Z^2+16*X*Y^4*Z+18*X*Y^3*Z+22*X*Y^2*Z+68*X*Y*Z

Algorithm definition

The algorithm ⟨2×7×18:198⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨2×7×9:99⟩.

Algorithm description

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