期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：1
页码：749-754
语种：English
出版社：Ayushmaan Technologies
摘要：The main focus of this paper is to compare the execution timecomplexity and space complexity between Strassen’s algorithmand the conventional algorithm for matrix multiplication. Theaim is to design a program, which generates two matrices withvarious dimensions, and multiplies the two matrices using boththe Strassen’s algorithm and the conventional algorithm. Theexecution time of each algorithm is recorded to evaluate theperformance of each algorithm. The programming languageused this project is Java. Some of the main achievements in thisproject are, successfully divide matrices into blocks, the Strassen’salgorithm was applied to each blocks recursively, and the level ofrecursion was controlled. The overall fnding is that the Strassen’salgorithm is more effcient than conventional algorithm on largesize of matrices. However, in scientifc computing, memory hasto be considered. The results show that Strassen’s algorithm needsmore memory allocations than the conventional algorithm, due tothe fact in design that more arrays need to be created.
