A fast way for matrix multiplication

• Main Author: Oh, Yi Hong
• Other Authors: Shu Jian Jun
• Format: Final Year Project
• Language: English
• Published: 2018
• Subjects: DRNTU::Engineering::Mechanical engineering
• Online Access: http://hdl.handle.net/10356/75540
• Institution: Nanyang Technological University

The importance of matrix multiplication is immense. Considerable amount of applications in computer science requires matrix multiplication. The Strassen’s algorithm for multiplying 2 × 2 matrices requires seven multiplications and eighteen additions. Winograd showed that seven multiplications are the minimal amount multiplying 2 × 2 matrices. Winograd also discovered a Strassen-like algorithm with fifteen additions together with Coppersmith. Research carried out in this field are generally done through mathematical theorems. The paper attempts to find a better Strassen-like algorithm through an exhaustive method.