期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：III
期号：I – Ver 4
出版社：Ayushmaan Technologies
摘要：The main focus of this paper is to compare the execution time complexity and space complexity between Strassen's algorithm and the conventional algorithm for matrix multiplication. The aim is to design a program, which generates two matrices with various dimensions, and multiplies the two matrices using both the Strassen 's algorithm and the convention al algorithm. The execution time of each algo rithm is record ed to ev aluate the performance of each algorithm. The program ming language used this project is Java. Some of the main achievements in this project are, successfully divide matrices into blocks, the Strassen's algorithm was applied to each blocks recursively, and the level of recursion was controlled. The overall finding is that the Strassen's algorithm is more efficient than conventional algorithm on large size of matrices. However, in scientific computing, memory has to be considered. The results show that Strassen's algorithm needs more memory allocations than the conventional algorithm, due to the fact in design that more arrays need to be created
