Description of fast matrix multiplication algorithm: ⟨3×12×23:616⟩

Algorithm type

160X3Y3Z2+240X3Y3Z+72X2Y2Z2+72X2YZ+72XY2Z160X3Y3Z2240X3Y3Z72X2Y2Z272X2YZ72XY2Z160*X^3*Y^3*Z^2+240*X^3*Y^3*Z+72*X^2*Y^2*Z^2+72*X^2*Y*Z+72*X*Y^2*Z

Algorithm definition

The algorithm ⟨3×12×23:616⟩ is the (Kronecker) tensor product of ⟨3×6×23:308⟩ with ⟨1×2×1:2⟩.

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