Description of fast matrix multiplication algorithm: ⟨6×18×29:1880⟩

Algorithm type

32X4Y12Z6+48X2Y12Z6+64X2Y12Z3+176X4Y6Z6+96XY12Z3+128X2Y9Z3+264X2Y6Z6+192XY9Z3+64X2Y6Z3+96XY6Z3+288X2Y3Z3+432XY3Z332X4Y12Z648X2Y12Z664X2Y12Z3176X4Y6Z696XY12Z3128X2Y9Z3264X2Y6Z6192XY9Z364X2Y6Z396XY6Z3288X2Y3Z3432XY3Z332*X^4*Y^12*Z^6+48*X^2*Y^12*Z^6+64*X^2*Y^12*Z^3+176*X^4*Y^6*Z^6+96*X*Y^12*Z^3+128*X^2*Y^9*Z^3+264*X^2*Y^6*Z^6+192*X*Y^9*Z^3+64*X^2*Y^6*Z^3+96*X*Y^6*Z^3+288*X^2*Y^3*Z^3+432*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨6×18×29:1880⟩ is the projection [[0, 0], [30]] of ⟨6×18×30:1880⟩.

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