Optimisation of Algorithms for Matrix-Vector Multiplication by Using an Evolutionary Algorithm

Abstract

Reducing the number of single operation during matrix-vector multiplication is a method of accelerating of multiplication and decreasing power consumption. It is often not a simple task. The paper presents the methods for looking for the proper structure of the matrix using an evolutionary algorithm and the hill-climbing. The evaluation function, defined in the paper, leads to improvements in the form of the matrix by getting a proper structure. The optimisation process is made by using a special defined crossover and two types of mutations. The investigation presented in the paper confirms the possibility of automatically finding a special structure of a matrix.