Description of fast matrix multiplication algorithm: ⟨6×12×30:1320⟩

Algorithm type

112X4Y6Z6+80X2Y9Z3+168X2Y6Z6+120XY9Z3+64X2Y6Z3+96XY6Z3+272X2Y3Z3+408XY3Z3112X4Y6Z680X2Y9Z3168X2Y6Z6120XY9Z364X2Y6Z396XY6Z3272X2Y3Z3408XY3Z3112*X^4*Y^6*Z^6+80*X^2*Y^9*Z^3+168*X^2*Y^6*Z^6+120*X*Y^9*Z^3+64*X^2*Y^6*Z^3+96*X*Y^6*Z^3+272*X^2*Y^3*Z^3+408*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨6×12×30:1320⟩ is the (Kronecker) tensor product of ⟨2×4×5:33⟩ 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