Description of fast matrix multiplication algorithm: ⟨3×14×15:475⟩

Algorithm type

160X3Y3Z2+240X3Y3Z+15X2Y2Z2+30XYZ2+30XYZ160X3Y3Z2240X3Y3Z15X2Y2Z230XYZ230XYZ160*X^3*Y^3*Z^2+240*X^3*Y^3*Z+15*X^2*Y^2*Z^2+30*X*Y*Z^2+30*X*Y*Z

Algorithm definition

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

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