Description of fast matrix multiplication algorithm: ⟨6×15×18:1000⟩

Algorithm type

80X4Y6Z6+32X2Y9Z3+120X2Y6Z6+48XY9Z3+96X2Y6Z3+144XY6Z3+192X2Y3Z3+288XY3Z380X4Y6Z632X2Y9Z3120X2Y6Z648XY9Z396X2Y6Z3144XY6Z3192X2Y3Z3288XY3Z380*X^4*Y^6*Z^6+32*X^2*Y^9*Z^3+120*X^2*Y^6*Z^6+48*X*Y^9*Z^3+96*X^2*Y^6*Z^3+144*X*Y^6*Z^3+192*X^2*Y^3*Z^3+288*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨6×15×18:1000⟩ is the (Kronecker) tensor product of ⟨2×5×3:25⟩ with ⟨3×3×6:40⟩.

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