Abstract. This paper proposes fast algorithms for the cellular operation that are based on hybrid multiplication algorithms for matrices of order n=3μ (μ >1), n=6μ (μ >0) and are characterized by the lowest computational complexity as compared with the well-known algorithms. The multiplicative, additive, and overall complexities of the above-mentioned algorithms are estimated.

Keywords: linear algebra, cellular method, basic operation, fast algorithm of matrix multiplication.