Description of fast matrix multiplication algorithm: ⟨4×12×28:900⟩

Algorithm type

4 X^{4} Y^{8} Z^{4} + 4 X^{2} Y^{12} Z^{2} + 4 X^{4} Y^{6} Z^{4} + 16 X Y^{12} Z + 4 X^{2} Y^{9} Z^{2} + 36 X^{4} Y^{4} Z^{4} + 16 X^{2} Y^{8} Z^{2} + 24 X Y^{9} Z + 60 X^{2} Y^{6} Z^{2} + 20 X^{2} Y^{4} Z^{2} + 8 X Y^{6} Z + 12 X^{2} Y^{3} Z^{2} + 196 X^{2} Y^{2} Z^{2} + 48 X Y^{4} Z + 160 X Y^{3} Z + 24 X Y^{2} Z + 264 X Y Z

Algorithm definition

The algorithm ⟨4×12×28:900⟩ is the (Kronecker) tensor product of ⟨2×3×4:20⟩ with ⟨2×4×7:45⟩.

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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