Reviewing Matrix Muliplication
Abstract
Algorithm written using different methods can still give same result. One of the ways to determine whether a solution is optimal or not is to determine how much time does it take to solve the specific problem. The problem that is targeted in this paper is Matrix multiplication that is widely used in many scientific computations. Different solutions of this problem are evaluated in this paper and all of them are compared on the basis of their time complexity. After comparing five most known algorithms for matrix multiplication we concluded that coppersmith-winograd algorithm is fastest in terms of time.
Downloads
Published
Issue
Section
License
Copyright (c) 2021 Journal of Computational Learning Strategies & Practices
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The journal is open access. Reading, downloading, copying, distributing and use of any material for academic and research purposes is free. The copyright in the Journal is owned by the CLSP. Unauthorized copying or redistribution for any financial or earning purpose will be violation of copyright laws. Moreover, managing editor is not responsible for originality of the articles accepted for the journal. However, the authors would be accountable if the ideas and the materials are found plagiarized. The journal is in the process of licensing under a Creative Commons Attribution- Non Commercial 4.0 International License. All articles published by JCLSP will be licensed under the Creative Commons Attribution 4.0 International License. This permits anyone to copy, redistribute, transmit and adapt the work provided the original work and source is appropriately cited as specified by the Creative Commons Attribution License.
