Description of fast matrix multiplication algorithm: ⟨10×15×18:1646⟩

Algorithm type

120X4Y4Z4+5X6Y2Z2+X4Y2Z4+3X3Y2Z5+9X2Y6Z2+3X2Y4Z4+7X2Y2Z6+2X7YZ+X6YZ2+X2Y2Z5+XYZ7+3X6YZ+37X4Y2Z2+282X2Y4Z2+X2Y3Z3+40X2Y2Z4+X2YZ5+18XY6Z+XYZ6+3X4YZ2+X3Y3Z+3X3YZ3+4X2YZ4+6XY4Z2+XYZ5+6X4YZ+6X3YZ2+X2Y3Z+306X2Y2Z2+7X2YZ3+84XY4Z+12XY2Z3+9X3YZ+60X2Y2Z+9X2YZ2+19XY3Z+84XY2Z2+16XYZ3+72X2YZ+198XY2Z+82XYZ2+121XYZ120X4Y4Z45X6Y2Z2X4Y2Z43X3Y2Z59X2Y6Z23X2Y4Z47X2Y2Z62X7YZX6YZ2X2Y2Z5XYZ73X6YZ37X4Y2Z2282X2Y4Z2X2Y3Z340X2Y2Z4X2YZ518XY6ZXYZ63X4YZ2X3Y3Z3X3YZ34X2YZ46XY4Z2XYZ56X4YZ6X3YZ2X2Y3Z306X2Y2Z27X2YZ384XY4Z12XY2Z39X3YZ60X2Y2Z9X2YZ219XY3Z84XY2Z216XYZ372X2YZ198XY2Z82XYZ2121XYZ120*X^4*Y^4*Z^4+5*X^6*Y^2*Z^2+X^4*Y^2*Z^4+3*X^3*Y^2*Z^5+9*X^2*Y^6*Z^2+3*X^2*Y^4*Z^4+7*X^2*Y^2*Z^6+2*X^7*Y*Z+X^6*Y*Z^2+X^2*Y^2*Z^5+X*Y*Z^7+3*X^6*Y*Z+37*X^4*Y^2*Z^2+282*X^2*Y^4*Z^2+X^2*Y^3*Z^3+40*X^2*Y^2*Z^4+X^2*Y*Z^5+18*X*Y^6*Z+X*Y*Z^6+3*X^4*Y*Z^2+X^3*Y^3*Z+3*X^3*Y*Z^3+4*X^2*Y*Z^4+6*X*Y^4*Z^2+X*Y*Z^5+6*X^4*Y*Z+6*X^3*Y*Z^2+X^2*Y^3*Z+306*X^2*Y^2*Z^2+7*X^2*Y*Z^3+84*X*Y^4*Z+12*X*Y^2*Z^3+9*X^3*Y*Z+60*X^2*Y^2*Z+9*X^2*Y*Z^2+19*X*Y^3*Z+84*X*Y^2*Z^2+16*X*Y*Z^3+72*X^2*Y*Z+198*X*Y^2*Z+82*X*Y*Z^2+121*X*Y*Z

Algorithm definition

The algorithm ⟨10×15×18:1646⟩ is serendipitous tensor product (⟨5×5×6:110⟩ - 8) ⊗ ⟨2×3×3:15⟩ +4⟨4×3×3:29⟩.

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