Methodology Of Matrix Multiplication

1202 Words3 Pages

Literature Survey The matrix multiplication plays a vital role in many numerical algorithms, many kinds of researches have been done to make matrix multiplication algorithms efficient. The Strassen’s matrix multiplication [4] is most widely algorithm use to reduce the complexity. Various works have been done in order to implement strassen’s algorithm in many applications. Coppersmith-Winograd algorithm was asymptotically fastest known algorithm until 2010. Strassen-Winograd’s matrix multiplication plays a vital role in scheduling memory efficiently [7]. In 1984 for the first time, DCT was used for image compression although it was proposed in the year 1974. Discrete Cosine Transform (DCT) is widely used in image compression for conversion of the signal …show more content…

"Image compression using discrete cosine transform." Georgian Electronic Scientific Journal: Computer Science and Telecommunications 17.3 (2008): 35-43. Huss-Lederman, S., Jacobson, E. M., Johnson, J. R., Tsao, A., & Turnbull, T. (1996). Implementation of Strassen's algorithm for matrix multiplication. In Supercomputing, 1996. Proceedings of the 1996 ACM/IEEE Conference on (pp. 32-32). IEEE. Cormen, Thomas H. Introduction to algorithms. MIT press, 2009. Hedtke, Ivo. "Strassen’s matrix multiplication algorithm for matrices of arbitrary order." arXiv preprint arXiv:1007.2117 (2010). Oh, Seunghyun, and Byung-Ro Moon. "Automatic reproduction of a genius algorithm: Strassen's algorithm revisited by genetic search." IEEE Transactions on Evolutionary Computation 14.2 (2010): 246-251. Boyer, Brice, et al. "Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm." Proceedings of the 2009 international symposium on Symbolic and algebraic computation. ACM, 2009. Li, Junjie, Sanjay Ranka, and Sartaj Sahni. "Strassen's matrix multiplication on GPUs." Parallel and Distributed Systems (ICPADS), 2011 IEEE 17th International Conference on. IEEE,

Open Document