论文信息 - Performance comparison of matrix multiplication algorithms

Performance comparison of matrix multiplication algorithms

Software has gained its importance in all aspects of every walk of life. Algorithms play a vital role in ensuring the successful operation of any software. According to the applications, various algorithms have been designed in order to accomplish the desired goals. This paper therefore aims to provide an insight on significance of performance and further, throw light on various matrix multiplication algorithms. The paper also puts forth a comparative analysis on the efficiency of performance of matrix multiplication algorithms by considering suitable factors. This work thus enables one to comprehend the suitability of the algorithm based on the chosen factors.

S Pradyumna

[1] Peng Zhang,et al. Matrix Multiplication on High-Density Multi-GPU Architectures: Theoretical and Experimental Investigations , 2015, ISC.

[2] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[3] Maryna Babayeva. Goto Statement Considered Harmful – A Paper Review , 2011 .

[4] François Le Gall,et al. Faster Algorithms for Rectangular Matrix Multiplication , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[5] Li Fei-Fei,et al. Unsupervised Learning of Long-Term Motion Dynamics for Videos , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[6] Virginia Vassilevska Williams. Multiplying matrices in O(n 2:373 ) time , 2014 .

[7] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.

[8] Victor Y. Pan,et al. The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms , 1985 .