Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Short Review on Fast Ways to Multiply Two Matrices
Version 1
: Received: 10 September 2022 / Approved: 12 September 2022 / Online: 12 September 2022 (12:59:25 CEST)
How to cite: Banerjee, I. A Short Review on Fast Ways to Multiply Two Matrices. Preprints 2022, 2022090150. https://doi.org/10.20944/preprints202209.0150.v1 Banerjee, I. A Short Review on Fast Ways to Multiply Two Matrices. Preprints 2022, 2022090150. https://doi.org/10.20944/preprints202209.0150.v1
Abstract
Matrix multiplication is probably one of the most basic and important operations having a wide range of applications in studying Linear algebra. We will be primarily focused on reviewing different algorithms for the multiplication of two n×n matrices. The most Naive method has a complexity of O(n3) but interestingly, algorithms with better complexity have been achieved. We will get to see how the complexity can be improved further, occasionally giving a survey.
Keywords
Matrix multiplication; Complexity; Matrix multiplication constant; Algorithm; Tensors; Tensor product; Tensor power
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
