Description of fast matrix multiplication algorithm: ⟨15×24×28:5607⟩

Algorithm type

657X4Y4Z4+6X4Y2Z4+36X2Y4Z4+804X4Y2Z2+936X2Y4Z2+342X2Y2Z4+12X4YZ2+36XY4Z2+150X4YZ+414X2Y2Z2+288XY4Z+414X2Y2Z+372X2YZ2+324XY2Z2+402X2YZ+342XY2Z+36XYZ2+36XYZ657X4Y4Z46X4Y2Z436X2Y4Z4804X4Y2Z2936X2Y4Z2342X2Y2Z412X4YZ236XY4Z2150X4YZ414X2Y2Z2288XY4Z414X2Y2Z372X2YZ2324XY2Z2402X2YZ342XY2Z36XYZ236XYZ657*X^4*Y^4*Z^4+6*X^4*Y^2*Z^4+36*X^2*Y^4*Z^4+804*X^4*Y^2*Z^2+936*X^2*Y^4*Z^2+342*X^2*Y^2*Z^4+12*X^4*Y*Z^2+36*X*Y^4*Z^2+150*X^4*Y*Z+414*X^2*Y^2*Z^2+288*X*Y^4*Z+414*X^2*Y^2*Z+372*X^2*Y*Z^2+324*X*Y^2*Z^2+402*X^2*Y*Z+342*X*Y^2*Z+36*X*Y*Z^2+36*X*Y*Z

Algorithm definition

The algorithm ⟨15×24×28:5607⟩ is serendipitous tensor product (⟨5×4×7:104⟩ - 6) ⊗ ⟨3×6×4:54⟩ +3⟨6×6×4:105⟩.

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