Output details

Genetic algorithms for discovery of matrix multiplication methods

<22> More efficient matrix multiplication methods would have huge impact on practical implementation of matrix calculations used in mathematical software packages. For square matrices of size 3, there are no known practical methods reaching the theoretical lower bound. The new algorithm discovered by genetic algorithms is one of very few approximate methods. Discovery of an exact method would imply that multiplication of large matrices would switch to use this instead of the algorithm used since 1968. The authors were invited to talk at the Genetic and Evolutionary Computation conference (2011), after being shortlisted for the Human-Competitive Results competition.