Fast hybrid matrix multiplication algorithms

Authors:
L. D. Jelfimova
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 8
Cited 0

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
VLSI and Modern Signal Processing

VLSI and Modern Signal Processing
A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays

Cybernetics and Systems Analysis
An Integrated Approach to the Design of Processor Arrays with Systolic Organization of Computations

Cybernetics and Systems Analysis
A New Algorithm for Inner Product

IEEE Transactions on Computers
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
A fast cellular method of matrix multiplication

Cybernetics and Systems Analysis
A mixed cellular method of matrix multiplication

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.