conference paper · International Conference & Workshop on Emerging Trends in Technology · 2011
KS ring theoretic approach for matrix multiplication
S. Shamshu Dharwez, B. Karpagam
Cited by 0Abstract and details only
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.
Cite this paper
Dharwez, S. S., & Karpagam, B. (2011). KS ring theoretic approach for matrix multiplication. International Conference & Workshop on Emerging Trends in Technology, 455–458. https://doi.org/10.1145/1980022.1980119
Dharwez, S. Shamshu, and B. Karpagam. “KS ring theoretic approach for matrix multiplication.” International Conference & Workshop on Emerging Trends in Technology, 2011, pp. 455–58, https://doi.org/10.1145/1980022.1980119.
Dharwez, S. Shamshu, and B. Karpagam. 2011. “KS ring theoretic approach for matrix multiplication.” International Conference & Workshop on Emerging Trends in Technology: 455–58. https://doi.org/10.1145/1980022.1980119.
Dharwez, S.S. and Karpagam, B. (2011) ‘KS ring theoretic approach for matrix multiplication’, International Conference & Workshop on Emerging Trends in Technology, pp. 455–458. Available at: https://doi.org/10.1145/1980022.1980119.
@article{dharwez2011ring,
title = {{KS ring theoretic approach for matrix multiplication}},
author = {Dharwez, S. Shamshu and Karpagam, B.},
journal = {International Conference & Workshop on Emerging Trends in Technology},
pages = {455--458},
year = {2011},
doi = {10.1145/1980022.1980119}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
A New Fast Recursive Matrix Multiplication Algorithm
L. D. Jelfimova · Cybernetics and Systems Analysis · 2019
Cited by 3
A noncommutative algorithm for multiplying 5×5 matrices using 103 multiplications
Gabriel A. Schachtel · Information Processing Letters · 1978
Cited by 9
Optimization techniques for small matrix multiplication
Charles Éric Drevet, Md. Nazrul Islam, Éric Schost · Theoretical Computer Science · 2010
Cited by 43Open access
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method
Andris Ambainis, Yuval Filmus, François Le Gall · ACM Symposium on Theory of Computing (STOC) · 2015
Cited by 62Open access
A Fast Recursive Algorithm for Multiplying Matrices of Order n = 3q (q > 1)
L. D. Jelfimova · Cybernetics and Systems Analysis · 2021
Cited by 1Open access
Survey on matrix multiplication algorithms
Shohana Afroz, Maisha Tahaseen, Fahmida Ahmed et al. · International Conference on Informatics, Electronics & Vision (ICIEV) · 2016
Cited by 6