Abstract
This paper proposes two new cellular methods of matrix multiplication that allow one to obtain cellular analogs of well-known matrix multiplication algorithms with reduced computational complexities as compared with analogs derived on the basis of well-known cellular methods of matrix multiplication. The new fast cellular method reduces the multiplicative, additive, and overall complexities of the mentioned algorithms by 15%. The new mixed cellular method combines the Laderman method with the proposed fast cellular method. The interaction of these methods reduces the multiplicative, additive, and overall complexities of the matrix multiplication algorithms by 28%. Computational complexities of these methods are estimated using a model of obtaining cellular analogs of the traditional matrix multiplication algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
