Description of fast matrix multiplication algorithm: ⟨3×5×15:174⟩

Algorithm type

3X3Y2Z+51X2Y2Z2+6XY4Z+3XY2Z3+15X3YZ+6X2Y2Z+3XY3Z+6XY2Z2+15XYZ3+3X2YZ+39XY2Z+3XYZ2+21XYZ3X3Y2Z51X2Y2Z26XY4Z3XY2Z315X3YZ6X2Y2Z3XY3Z6XY2Z215XYZ33X2YZ39XY2Z3XYZ221XYZ3*X^3*Y^2*Z+51*X^2*Y^2*Z^2+6*X*Y^4*Z+3*X*Y^2*Z^3+15*X^3*Y*Z+6*X^2*Y^2*Z+3*X*Y^3*Z+6*X*Y^2*Z^2+15*X*Y*Z^3+3*X^2*Y*Z+39*X*Y^2*Z+3*X*Y*Z^2+21*X*Y*Z

Algorithm definition

The algorithm ⟨3×5×15:174⟩ is the (Kronecker) tensor product of ⟨3×5×5:58⟩ with ⟨1×1×3:3⟩.

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