Description of fast matrix multiplication algorithm: ⟨3×18×31:1248⟩

Algorithm type

432X3Y3Z2+648X3Y3Z+6X2Y3Z2+42X2Y2Z2+42X2YZ+18XY2Z+60XYZ432X3Y3Z2648X3Y3Z6X2Y3Z242X2Y2Z242X2YZ18XY2Z60XYZ432*X^3*Y^3*Z^2+648*X^3*Y^3*Z+6*X^2*Y^3*Z^2+42*X^2*Y^2*Z^2+42*X^2*Y*Z+18*X*Y^2*Z+60*X*Y*Z

Algorithm definition

The algorithm ⟨3×18×31:1248⟩ is the (Kronecker) tensor product of ⟨3×6×31:416⟩ with ⟨1×3×1: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