Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/78516
Title: A fast way to calculate multiplication with large inputs
Authors: Huang, Lixin
Keywords: DRNTU::Engineering::Mechanical engineering
Issue Date: 2019
Abstract: Matrix multiplication is significant in a lot of scientific fields, such as mathematics, physics and computer science. Multiplying matrices is a fundamental operation for many numerical algorithms. The faster matrix multiplications, the more efficient algorithms. Many researches have been done to make matrix multiplication algorithm efficient. For multiplication between two 2 × 2 matrices, Strassen Algorithm was the first published efficient algorithm. And this discover promoted more researches for finding faster matrix multiplication algorithms. In this report, a new faster algorithm (Gaussian Elimination – based) for 2 × 2 matrices multiplication with large inputs was proposed and implemented. The algorithms involved in this project were the new Gaussian Elimination – based algorithm, Strassen Algorithm and Naïve Algorithm. C++ language programming was employed to perform algorithms’ running and calculate the consumed CPU time for each algorithm. Data collection and analysis were done by Microsoft Excel.
URI: http://hdl.handle.net/10356/78516
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 
HUANG LIXIN_FYP report-final version.pdf
  Restricted Access
1.21 MBAdobe PDFView/Open

Page view(s)

274
Updated on Jun 17, 2024

Download(s) 50

38
Updated on Jun 17, 2024

Google ScholarTM

Check

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