Preprint
Article
A Short Review on Fast Ways to Multiply Two Matrices
Altmetrics
Downloads
275
Views
64
Comments
0
This version is not peer-reviewed
Submitted:
10 September 2022
Posted:
12 September 2022
You are already at the latest version
Alerts
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:
Subject: Computer Science and Mathematics - Computational Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
MDPI Initiatives
Important Links
© 2024 MDPI (Basel, Switzerland) unless otherwise stated