Description of fast matrix multiplication algorithm: ⟨12×15×21:2200⟩

Algorithm type

32X6Y10Z6+32X6Y8Z6+16X6Y6Z6+48X6Y5Z6+208X6Y4Z6+96X3Y10Z3+24X6Y3Z6+256X6Y2Z6+112X3Y8Z3+24X6YZ6+64X3Y6Z3+144X3Y5Z3+32X3Y2Z6+264X3Y4Z3+48X3YZ6+96X3Y3Z3+368X3Y2Z3+336X3YZ332X6Y10Z632X6Y8Z616X6Y6Z648X6Y5Z6208X6Y4Z696X3Y10Z324X6Y3Z6256X6Y2Z6112X3Y8Z324X6YZ664X3Y6Z3144X3Y5Z332X3Y2Z6264X3Y4Z348X3YZ696X3Y3Z3368X3Y2Z3336X3YZ332*X^6*Y^10*Z^6+32*X^6*Y^8*Z^6+16*X^6*Y^6*Z^6+48*X^6*Y^5*Z^6+208*X^6*Y^4*Z^6+96*X^3*Y^10*Z^3+24*X^6*Y^3*Z^6+256*X^6*Y^2*Z^6+112*X^3*Y^8*Z^3+24*X^6*Y*Z^6+64*X^3*Y^6*Z^3+144*X^3*Y^5*Z^3+32*X^3*Y^2*Z^6+264*X^3*Y^4*Z^3+48*X^3*Y*Z^6+96*X^3*Y^3*Z^3+368*X^3*Y^2*Z^3+336*X^3*Y*Z^3

Algorithm definition

The algorithm ⟨12×15×21:2200⟩ is the (Kronecker) tensor product of ⟨2×5×7:55⟩ with ⟨6×3×3: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