Description of fast matrix multiplication algorithm: ⟨8×16×16:1274⟩

Algorithm type

6X8Y8Z8+2X4Y12Z4+8X4Y8Z4+82X4Y4Z4+24X2Y6Z2+96X2Y4Z2+336X2Y2Z2+72XY3Z+288XY2Z+360XYZ6X8Y8Z82X4Y12Z48X4Y8Z482X4Y4Z424X2Y6Z296X2Y4Z2336X2Y2Z272XY3Z288XY2Z360XYZ6*X^8*Y^8*Z^8+2*X^4*Y^12*Z^4+8*X^4*Y^8*Z^4+82*X^4*Y^4*Z^4+24*X^2*Y^6*Z^2+96*X^2*Y^4*Z^2+336*X^2*Y^2*Z^2+72*X*Y^3*Z+288*X*Y^2*Z+360*X*Y*Z

Algorithm definition

The algorithm ⟨8×16×16:1274⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨4×8×8:182⟩.

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