Description of fast matrix multiplication algorithm: ⟨9×15×18:1440⟩

Algorithm type

144X4Y6Z6+216X2Y6Z6+32X6Y3Z3+96X2Y6Z3+96X4Y3Z3+144XY6Z3+48X3Y3Z3+352X2Y3Z3+312XY3Z3144X4Y6Z6216X2Y6Z632X6Y3Z396X2Y6Z396X4Y3Z3144XY6Z348X3Y3Z3352X2Y3Z3312XY3Z3144*X^4*Y^6*Z^6+216*X^2*Y^6*Z^6+32*X^6*Y^3*Z^3+96*X^2*Y^6*Z^3+96*X^4*Y^3*Z^3+144*X*Y^6*Z^3+48*X^3*Y^3*Z^3+352*X^2*Y^3*Z^3+312*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨9×15×18:1440⟩ is the (Kronecker) tensor product of ⟨3×3×6:40⟩ with ⟨3×5×3:36⟩.

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