Description of fast matrix multiplication algorithm: ⟨4×6×26:455⟩

Algorithm type

13X4Y4Z4+4X2Y6Z2+18X2Y4Z2+108X2Y2Z2+24XY3Z+108XY2Z+180XYZ13X4Y4Z44X2Y6Z218X2Y4Z2108X2Y2Z224XY3Z108XY2Z180XYZ13*X^4*Y^4*Z^4+4*X^2*Y^6*Z^2+18*X^2*Y^4*Z^2+108*X^2*Y^2*Z^2+24*X*Y^3*Z+108*X*Y^2*Z+180*X*Y*Z

Algorithm definition

The algorithm ⟨4×6×26:455⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨2×3×13:65⟩.

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