Description of fast matrix multiplication algorithm: ⟨9×10×28:1578⟩

Algorithm type

8X4Y6Z4+96X4Y4Z4+8X2Y8Z2+8X2Y3Z6+28XYZ9+8X6Y2Z2+16X2Y6Z2+24X2Y4Z4+124X2Y2Z6+24XY2Z6+8X4Y2Z2+55X2Y4Z2+48X2Y2Z4+8XY4Z3+48XYZ6+8X3YZ3+29X2Y3Z2+2X2Y2Z3+XY5Z+XY4Z2+16XY3Z3+X2Y3Z+303X2Y2Z2+8X2YZ3+27XY4Z+XY3Z2+52XY2Z3+27X3YZ+2X2Y2Z+56XY3Z+72XY2Z2+97XYZ3+25X2YZ+159XY2Z+144XYZ2+36XYZ8X4Y6Z496X4Y4Z48X2Y8Z28X2Y3Z628XYZ98X6Y2Z216X2Y6Z224X2Y4Z4124X2Y2Z624XY2Z68X4Y2Z255X2Y4Z248X2Y2Z48XY4Z348XYZ68X3YZ329X2Y3Z22X2Y2Z3XY5ZXY4Z216XY3Z3X2Y3Z303X2Y2Z28X2YZ327XY4ZXY3Z252XY2Z327X3YZ2X2Y2Z56XY3Z72XY2Z297XYZ325X2YZ159XY2Z144XYZ236XYZ8*X^4*Y^6*Z^4+96*X^4*Y^4*Z^4+8*X^2*Y^8*Z^2+8*X^2*Y^3*Z^6+28*X*Y*Z^9+8*X^6*Y^2*Z^2+16*X^2*Y^6*Z^2+24*X^2*Y^4*Z^4+124*X^2*Y^2*Z^6+24*X*Y^2*Z^6+8*X^4*Y^2*Z^2+55*X^2*Y^4*Z^2+48*X^2*Y^2*Z^4+8*X*Y^4*Z^3+48*X*Y*Z^6+8*X^3*Y*Z^3+29*X^2*Y^3*Z^2+2*X^2*Y^2*Z^3+X*Y^5*Z+X*Y^4*Z^2+16*X*Y^3*Z^3+X^2*Y^3*Z+303*X^2*Y^2*Z^2+8*X^2*Y*Z^3+27*X*Y^4*Z+X*Y^3*Z^2+52*X*Y^2*Z^3+27*X^3*Y*Z+2*X^2*Y^2*Z+56*X*Y^3*Z+72*X*Y^2*Z^2+97*X*Y*Z^3+25*X^2*Y*Z+159*X*Y^2*Z+144*X*Y*Z^2+36*X*Y*Z

Algorithm definition

The algorithm ⟨9×10×28:1578⟩ is serendipitous tensor product (⟨3×5×7:79⟩ - 2) ⊗ ⟨3×2×4:20⟩ +⟨3×4×4:38⟩.

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