Abstract
New hybrid algorithms for matrix multiplication are proposed that have the lowest computational complexity in comparison with well-known matrix multiplication algorithms. Based on the proposed algorithms, efficient algorithms are developed for the basic operation \( D = C + \sum\limits_{l =1}^{\xi} A_{l} B_{l}\) of cellular methods of linear algebra, where A, B, and D are square matrices of cell size. The computational complexity of the proposed algorithms is estimated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow–Leningrad (1963).
S. Y. Kung, H. J. Whitehouse, and T. Kailath (eds.), VLSI and Modern Signal Processing [Russian translation], Radio i Svyaz’, Moscow (1989).
A. V. Voevodin, “A class of cellular algorithms and its properties,” Voprosy Kibernetiki, No. 135, 50–64 (1988).
S. Yu. Lysanov, “Cellular methods of solution of problems of linear algebra,” Voprosy Kibernetiki, No. 135, 64–73 (1988).
S. A. Winograd, “A new algorithm for inner product,” IEEE Trans. Comp., C-18, 693–694 (1968).
V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., 13, 354–356 (1969).
S. Winograd, “On multiplication of 2×2 matrices,” Linear Algebra and Its Application, 4, 381–388 (1971).
V. Ya. Pan, “Strassen’s algorithm is not optimal,” in: Proc. 19th IEEE Symposium on Foundation of Computer Science (1978), pp. 166–176.
D. Bini, M. Capovani, G. Lotti, and F. Romani, “O (n 2.7799) complexity for approximate matrix multiplication,” Information Proc. Letters, 8, 234–235 (1979).
A. Schönhage, “Partial and total matrix multiplication,” SIAM J. Comput., 10, No. 3, 434–435 (1981).
D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,” SIAM J. Comput., 11, No. 3, 472–492 (1982).
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” J. of Symbolic Comput., No. 9, 251–280 (1990).
L. D. Elfimova and Yu. V. Kapitonova, “A fast algorithm for matrix multiplication and its efficient realization on systolic arrays,” Cybernetics and Systems Analysis, No. 1, 109–121 (2001).
L. D. Elfimova, “A fast cellular method of matrix multiplication,” Cybernetics and Systems Analysis, No. 3, 357–361 (2008).
L. D. Elfimova, “A mixed cellular method of matrix multiplication,” Cybernetics and Systems Analysis, No. 1, 19–24 (2009).
L. Jelfimova, “A new fast systolic array for modified Winograd algorithm,” in: Proc. 7th Int. Workshop on Parallel Processing by Cellular Automata and Arrays, PARCELLA-96 (Berlin, Germany, Sept. 1996), 96, Akad. Verlag., Berlin (1996), pp. 157–164.
L. D. Elfimova and Yu. V. Kapitonova, “An integrated approach to the design of processor arrays with systolic organization of computations,” Cybernetics and Systems Analysis, No. 6, 797–807 (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 49–59, July–August 2010.
Rights and permissions
About this article
Cite this article
Jelfimova, L.D. Fast hybrid matrix multiplication algorithms. Cybern Syst Anal 46, 563–573 (2010). https://doi.org/10.1007/s10559-010-9233-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-010-9233-y