Parallel Algorithms and Matrix Computation
Parallel Algorithms and Matrix Computation
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
A mixed 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
| Hi-index | 0.00 |
This paper proposes a cellular method of matrix multiplication. The method reduces the multiplicative and additive complexities of well-known matrix multiplication algorithms by 12.5%. The computational complexities of cellular analogs of such algorithms are estimated. A fast cellular analog is presented whose multiplicative and additive complexities are equal to 驴0.382n3 multiplications and 驴1.147n3 additions, respectively, where n is the order of the matrices being multiplied.