Description of fast matrix multiplication algorithm: ⟨8×15×18:1347⟩

Algorithm type

90X4Y4Z4+X6Y2Z3+6X4Y4Z2+5X4Y2Z4+3X2Y6Z2+3X2Y4Z4+3X6YZ2+3X4Y2Z3+X3Y2Z4+21X4Y2Z2+2X3YZ4+228X2Y4Z2+40X2Y2Z4+6XY6Z+8X4YZ2+X3Y3Z+X3Y2Z2+2X3YZ3+12X2Y4Z+X2Y3Z2+4X2Y2Z3+7X2YZ4+6XY4Z2+X4YZ+4X3YZ2+227X2Y2Z2+96XY4Z+3XYZ4+2X3YZ+54X2Y2Z+13X2YZ2+7XY3Z+78XY2Z2+4XYZ3+43X2YZ+186XY2Z+83XYZ2+92XYZ90X4Y4Z4X6Y2Z36X4Y4Z25X4Y2Z43X2Y6Z23X2Y4Z43X6YZ23X4Y2Z3X3Y2Z421X4Y2Z22X3YZ4228X2Y4Z240X2Y2Z46XY6Z8X4YZ2X3Y3ZX3Y2Z22X3YZ312X2Y4ZX2Y3Z24X2Y2Z37X2YZ46XY4Z2X4YZ4X3YZ2227X2Y2Z296XY4Z3XYZ42X3YZ54X2Y2Z13X2YZ27XY3Z78XY2Z24XYZ343X2YZ186XY2Z83XYZ292XYZ90*X^4*Y^4*Z^4+X^6*Y^2*Z^3+6*X^4*Y^4*Z^2+5*X^4*Y^2*Z^4+3*X^2*Y^6*Z^2+3*X^2*Y^4*Z^4+3*X^6*Y*Z^2+3*X^4*Y^2*Z^3+X^3*Y^2*Z^4+21*X^4*Y^2*Z^2+2*X^3*Y*Z^4+228*X^2*Y^4*Z^2+40*X^2*Y^2*Z^4+6*X*Y^6*Z+8*X^4*Y*Z^2+X^3*Y^3*Z+X^3*Y^2*Z^2+2*X^3*Y*Z^3+12*X^2*Y^4*Z+X^2*Y^3*Z^2+4*X^2*Y^2*Z^3+7*X^2*Y*Z^4+6*X*Y^4*Z^2+X^4*Y*Z+4*X^3*Y*Z^2+227*X^2*Y^2*Z^2+96*X*Y^4*Z+3*X*Y*Z^4+2*X^3*Y*Z+54*X^2*Y^2*Z+13*X^2*Y*Z^2+7*X*Y^3*Z+78*X*Y^2*Z^2+4*X*Y*Z^3+43*X^2*Y*Z+186*X*Y^2*Z+83*X*Y*Z^2+92*X*Y*Z

Algorithm definition

The algorithm ⟨8×15×18:1347⟩ is serendipitous tensor product (⟨4×5×6:90⟩ - 6) ⊗ ⟨2×3×3:15⟩ +3⟨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