Description of fast matrix multiplication algorithm: ⟨15×18×28:4264⟩

Algorithm type

36X4Y4Z6+48X3Y9Z2+72X3Y9Z+432X4Y4Z4+36X2Y2Z8+36X6Y2Z2+16X3Y5Z2+83X2Y6Z2+108X2Y4Z4+72X2Y2Z6+36X4Y2Z3+24X3Y5Z+36X2Y4Z3+36X6YZ+468X4Y2Z2+655X2Y4Z2+252X2Y2Z4+84XY6Z+36X2YZ4+108XY4Z2+36XY2Z4+36X4YZ+36X3Y2Z+88X2Y3Z+162X2Y2Z2+72X2YZ3+222XY4Z+72XY2Z3+252X2Y2Z+252X2YZ2+252XY2Z2+56X2YZ+54XY2Z36X4Y4Z648X3Y9Z272X3Y9Z432X4Y4Z436X2Y2Z836X6Y2Z216X3Y5Z283X2Y6Z2108X2Y4Z472X2Y2Z636X4Y2Z324X3Y5Z36X2Y4Z336X6YZ468X4Y2Z2655X2Y4Z2252X2Y2Z484XY6Z36X2YZ4108XY4Z236XY2Z436X4YZ36X3Y2Z88X2Y3Z162X2Y2Z272X2YZ3222XY4Z72XY2Z3252X2Y2Z252X2YZ2252XY2Z256X2YZ54XY2Z36*X^4*Y^4*Z^6+48*X^3*Y^9*Z^2+72*X^3*Y^9*Z+432*X^4*Y^4*Z^4+36*X^2*Y^2*Z^8+36*X^6*Y^2*Z^2+16*X^3*Y^5*Z^2+83*X^2*Y^6*Z^2+108*X^2*Y^4*Z^4+72*X^2*Y^2*Z^6+36*X^4*Y^2*Z^3+24*X^3*Y^5*Z+36*X^2*Y^4*Z^3+36*X^6*Y*Z+468*X^4*Y^2*Z^2+655*X^2*Y^4*Z^2+252*X^2*Y^2*Z^4+84*X*Y^6*Z+36*X^2*Y*Z^4+108*X*Y^4*Z^2+36*X*Y^2*Z^4+36*X^4*Y*Z+36*X^3*Y^2*Z+88*X^2*Y^3*Z+162*X^2*Y^2*Z^2+72*X^2*Y*Z^3+222*X*Y^4*Z+72*X*Y^2*Z^3+252*X^2*Y^2*Z+252*X^2*Y*Z^2+252*X*Y^2*Z^2+56*X^2*Y*Z+54*X*Y^2*Z

Algorithm definition

The algorithm ⟨15×18×28:4264⟩ is serendipitous tensor product (⟨5×3×7:79⟩ - 5) ⊗ ⟨3×6×4:54⟩ +⟨3×6×20:268⟩.

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