A fast cellular method of matrix multiplication

Abstract

This paper proposes a cellular method of matrix multiplication. The method reduces the multiplicative and additive complexities of well-known matrix multiplication algorithms by 12.5%. The computational complexities of cellular analogs of such algorithms are estimated. A fast cellular analog is presented whose multiplicative and additive complexities are equal to ?0.382n3 multiplications and ?1.147n3 additions, respectively, where n is the order of the matrices being multiplied.