Please use this identifier to cite or link to this item:
Title: A fast way for matrix multiplication
Authors: Oh, Yi Hong
Keywords: DRNTU::Engineering::Mechanical engineering
Issue Date: 2018
Abstract: 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.
Schools: School of Mechanical and Aerospace Engineering 
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
A Fast Way to Compute Matrix Multiplication.pdf
  Restricted Access
A Fast Way to Compute Matrix Multiplication835.3 kBAdobe PDFView/Open

Page view(s)

Updated on Jul 15, 2024

Download(s) 50

Updated on Jul 15, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.