Abstract. The paper proposes two new cellular methods of matrix multiplication, which allow obtaining cellular analogs of the well-known matrix multiplication algorithms with reduced computational complexity, as compared with the analogs derived on the basis of the well-known cellular methods of matrix multiplication. The new fast cellular method reduces by 15% the multiplicative, additive, and overall complexities of the mentioned algorithms. The new mixed cellular method combines the Laderman method with the proposed fast cellular method. The interaction of these methods reduces by 28% the multiplicative, additive, and overall complexities of the matrix multiplication algorithms. The computational complexity of these methods are estimated using the model of getting cellular analogs of the traditional matrix multiplication algorithm. Refs: 7 titles.

Keywords: linear algebra, cellular method of matrix multiplication, fast hybrid algorithm of matrix multiplication, Laderman’s algorithm.