KS ring theoretic approach for matrix multiplication

Authors:
S. S. Dharwez;B. Karpagam
Affiliations:
PSG College of Technology, Coimbatore, India;PSG College of Technology, Coimbatore, India
Venue:
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Year:
2011

Citing 3
Cited 0

Fundamentals of digital image processing

Fundamentals of digital image processing
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A Group-Theoretic Approach to Fast Matrix Multiplication

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matrix multiplication is a very common operation performed in many real world applications. So much of research has been done in reducing the time complexity of multiplying two matrices by researchers like Strassen, Don Coppersmith, Shmuel Winograd etc. All mathematical software also rely upon the common matrix multiplication algorithm. But, if the matrices that has to be applied has some special properties in some applications, then their multiplication complexity can be reduced. So, in this paper a new algorithm for multiplying a special kind of n x n matrices which are used in analyzing electrical circuits is devised. This algorithm outperforms the previous fast recursive algorithm for matrix multiplication.