Description of fast matrix multiplication algorithm: ⟨10×21×24:2984⟩

Algorithm type

4X4Y4Z6+252X4Y4Z4+4X2Y8Z2+8X3Y4Z4+68X2Y6Z3+4X4Y2Z4+44X3Y4Z3+252X2Y6Z2+8X2Y4Z4+8X2Y2Z6+16XY8Z+96XY6Z3+4X3Y3Z3+8XY6Z2+80X4Y2Z2+168X2Y4Z2+64X2Y3Z3+84X2Y2Z4+140XY6Z+24X2Y4Z+20X2Y3Z2+28X2Y2Z3+8XY4Z2+104XY3Z3+4XY2Z4+80X2Y3Z+436X2Y2Z2+40XY4Z+64XY3Z2+24XY2Z3+4X2YZ2+120XY3Z+8XY2Z2+8XYZ3+80X2YZ+300XY2Z+136XYZ2+184XYZ4X4Y4Z6252X4Y4Z44X2Y8Z28X3Y4Z468X2Y6Z34X4Y2Z444X3Y4Z3252X2Y6Z28X2Y4Z48X2Y2Z616XY8Z96XY6Z34X3Y3Z38XY6Z280X4Y2Z2168X2Y4Z264X2Y3Z384X2Y2Z4140XY6Z24X2Y4Z20X2Y3Z228X2Y2Z38XY4Z2104XY3Z34XY2Z480X2Y3Z436X2Y2Z240XY4Z64XY3Z224XY2Z34X2YZ2120XY3Z8XY2Z28XYZ380X2YZ300XY2Z136XYZ2184XYZ4*X^4*Y^4*Z^6+252*X^4*Y^4*Z^4+4*X^2*Y^8*Z^2+8*X^3*Y^4*Z^4+68*X^2*Y^6*Z^3+4*X^4*Y^2*Z^4+44*X^3*Y^4*Z^3+252*X^2*Y^6*Z^2+8*X^2*Y^4*Z^4+8*X^2*Y^2*Z^6+16*X*Y^8*Z+96*X*Y^6*Z^3+4*X^3*Y^3*Z^3+8*X*Y^6*Z^2+80*X^4*Y^2*Z^2+168*X^2*Y^4*Z^2+64*X^2*Y^3*Z^3+84*X^2*Y^2*Z^4+140*X*Y^6*Z+24*X^2*Y^4*Z+20*X^2*Y^3*Z^2+28*X^2*Y^2*Z^3+8*X*Y^4*Z^2+104*X*Y^3*Z^3+4*X*Y^2*Z^4+80*X^2*Y^3*Z+436*X^2*Y^2*Z^2+40*X*Y^4*Z+64*X*Y^3*Z^2+24*X*Y^2*Z^3+4*X^2*Y*Z^2+120*X*Y^3*Z+8*X*Y^2*Z^2+8*X*Y*Z^3+80*X^2*Y*Z+300*X*Y^2*Z+136*X*Y*Z^2+184*X*Y*Z

Algorithm definition

The algorithm ⟨10×21×24:2984⟩ is serendipitous tensor product (⟨2×3×4:20⟩ - 8) ⊗ ⟨5×7×6:150⟩ +4⟨5×7×12:296⟩.

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