Abstract
A unified cellular method for matrix multiplication is proposed. The method is a hybrid of three methods, namely, Strassen’s and Laderman’s recursive methods and a fast cellular method for matrix multiplication. The interaction of these three methods provides the highest (in comparison with well-known methods) percentage (equal to 37%) of minimization of the multiplicative, additive, and overall complexities of cellular analogues of well-known matrix multiplication algorithms. The estimation of the computational complexity of the unified method is illustrated by an example of obtaining a cellular analogue of the traditional matrix multiplication algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. D. Jelfimova, “Fast cellular method of matrix multiplication,” Cybernetics and Systems Analysis, 44, No. 3, 55–59 (2008).
L. D. Jelfimova, “A mixed cellular method of matrix multiplication,” Cybernetics and Systems Analysis, 45, No. 1, 22–27 (2009).
L. D. Jelfimova, “New cellular methods for matrix multiplication,” Cybernetics and Systems Analysis, 49, No. 1, 19–29 (2013).
V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., 13, 354–356 (1969).
J. D. Laderman, “A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications,” Bull. Amer. Math. Soc., 82, No. 1, 126–128 (1976).
D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow–Leningrad (1963).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, September–October, 2013, pp. 28–37.
Rights and permissions
About this article
Cite this article
Jelfimova, L.D. A unified cellular method for matrix multiplication. Cybern Syst Anal 49, 663–672 (2013). https://doi.org/10.1007/s10559-013-9553-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-013-9553-9