A mixed cellular method of matrix multiplication

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

Citing 7
Cited 2

Partitioning: An Essential Step in Mapping Algorithms Into Systolic Array Processors

Computer
The SUPRENUM supercomputer: goals, achievements, and lessons learned

Parallel Computing - Special double issue: SUPRENUM and GENESIS
Parallel supercomputer architectures and their programming models

Parallel Computing - Special double issue: SUPRENUM and GENESIS
CM-5E, KSR2, Paragon XP/S: a comparative description of massively parallel computers

Parallel Computing
A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays

Cybernetics and Systems Analysis
A New Algorithm for Inner Product

IEEE Transactions on Computers
A fast cellular method of matrix multiplication

Cybernetics and Systems Analysis

Fast hybrid matrix multiplication algorithms

Cybernetics and Systems Analysis
A unified cellular method for matrix multiplication

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mixed cellular method of matrix multiplication is proposed that combines the Strassen method with a fast cellular method of matrix multiplication. The interaction of these methods makes it possible to decrease the multiplicative and additive complexities of well-known matrix multiplication algorithms by 25%. Estimates of computational complexity of cellular analogues of the mentioned algorithms are given.