Description of fast matrix multiplication algorithm: ⟨3×4×16:150⟩

Algorithm type

6X2Y3Z2+4X2Y2Z3+32X2Y2Z2+2X2Y2Z+16XY3Z+2XY2Z2+34XY2Z+6XYZ2+48XYZ6X2Y3Z24X2Y2Z332X2Y2Z22X2Y2Z16XY3Z2XY2Z234XY2Z6XYZ248XYZ6*X^2*Y^3*Z^2+4*X^2*Y^2*Z^3+32*X^2*Y^2*Z^2+2*X^2*Y^2*Z+16*X*Y^3*Z+2*X*Y^2*Z^2+34*X*Y^2*Z+6*X*Y*Z^2+48*X*Y*Z

Algorithm definition

The algorithm ⟨3×4×16:150⟩ is the (Kronecker) tensor product of ⟨3×4×8:75⟩ with ⟨1×1×2:2⟩.

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