conference paper · International Conference on Informatics, Electronics & Vision (ICIEV) · 2016
Survey on matrix multiplication algorithms
Shohana Afroz, Maisha Tahaseen, Fahmida Ahmed, Khandaker Salman Farshee, Mohammad Nurul Huda
Cited by 6Abstract and details only
Abstract
This paper focuses on the time analysis of different matrix multiplication algorithms. In the paper, the methods invented by Karatsuba and Strassen are analyzed and implemented; theoretical and real time is calculated. Afterwards the Karatsuba and the Strassen algorithms are merged, and combining these two algorithms a new approach is designed, which can be considered as a method for reducing the time complexity.
Cite this paper
Afroz, S., Tahaseen, M., Ahmed, F., Farshee, K. S., & Huda, M. N. (2016). Survey on matrix multiplication algorithms. International Conference on Informatics, Electronics & Vision (ICIEV), 151–155. https://doi.org/10.1109/iciev.2016.7759985
Afroz, Shohana, et al. “Survey on matrix multiplication algorithms.” International Conference on Informatics, Electronics & Vision (ICIEV), 2016, pp. 151–55, https://doi.org/10.1109/iciev.2016.7759985.
Afroz, Shohana, Maisha Tahaseen, Fahmida Ahmed, Khandaker Salman Farshee, and Mohammad Nurul Huda. 2016. “Survey on matrix multiplication algorithms.” International Conference on Informatics, Electronics & Vision (ICIEV): 151–55. https://doi.org/10.1109/iciev.2016.7759985.
Afroz, S. et al. (2016) ‘Survey on matrix multiplication algorithms’, International Conference on Informatics, Electronics & Vision (ICIEV), pp. 151–155. Available at: https://doi.org/10.1109/iciev.2016.7759985.
@article{afroz2016survey,
title = {{Survey on matrix multiplication algorithms}},
author = {Afroz, Shohana and Tahaseen, Maisha and Ahmed, Fahmida and Farshee, Khandaker Salman and Huda, Mohammad Nurul},
journal = {International Conference on Informatics, Electronics & Vision (ICIEV)},
pages = {151--155},
year = {2016},
doi = {10.1109/iciev.2016.7759985}
}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
Analysis of the Time Complexity of Strassen Algorithm
Xiang Wang · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2013
Cited by 0Open access
Running Time Comparison and Applications of Multiplying $\mathbf{2} \times \mathbf{2}$ Matrices Using the Strassen Algorithm
Shanzhen Gao, Olumide Malomo, Ephrem Eyob et al. · International Conference on Computational Science and Computational Intelligence (CSCI) · 2022
Cited by 8
On the implementation of Strassen's fast multiplication algorithm
Jacques Cohen, Martin S. Roth · Acta Informatica · 1976
Cited by 33
Comparative Analysis of Computational Complexity of Fast Matrix Multiplication Algorithms
Albina S. Abdulsalyamova, Калита Диана Ивановна, Pavel Alekseyevich Lyakhov et al. · International Conference "Quality Management, Transport and Information Security, Information Technologies" (IT&QM&IS) · 2023
Cited by 2
A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity
Manan Roy Choudhury, Ishan Banerjee · International Conference on Advanced Computer Information Technologies (ACIT) · 2023
Cited by 0
The Strassen Algorithm and its Computational Complexity
R.J. Bressers · Utrecht University Repository (Utrecht University) · 2020
Cited by 0Open access
23. Fast Matrix Multiplication
Society for Industrial and Applied Mathematics eBooks · 2002
Cited by 3
Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix-Multiplikation
J. Spiess · Computing · 1976
Cited by 10