Description of fast matrix multiplication algorithm: ⟨4×16×25:1024⟩

Algorithm type

64 X^{4} Y^{16} Z^{4} + 128 X^{2} Y^{16} Z^{2} + 64 X Y^{16} Z + 256 X^{2} Y^{4} Z^{2} + 256 X Y^{4} Z + 256 X Y Z

Algorithm definition

The algorithm ⟨4×16×25:1024⟩ is the (Kronecker) tensor product of ⟨2×4×5:32⟩ with ⟨2×4×5:32⟩.

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