Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/141584
Title: A fast way to compute matrix multiplication
Authors: Khor, Yu Feng
Keywords: Engineering::Mechanical engineering
Issue Date: 2020
Publisher: Nanyang Technological University
Abstract: Matrix multiplication is an operation that produces a matrix from two matrices and its applications are vast and of great importance to many fields of engineering. In the modern age of technology, the study of how to improve the speed of computing matrix multiplications is still of great interest to computer scientists. The reason for such an interest is the need to improve the processing speeds of computers where many basic functions may require many rounds of matrix multiplications and reducing the time required for each round of matrix multiplication can greatly reduce the total processing time for each function. In this study, the author will attempt to devise a faster method for computing matrix multiplications with the use of mathematical theorems such as Convolution, Fourier Transform and Lattice Multiplication.
URI: https://hdl.handle.net/10356/141584
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] FYP REPORT.pdf
  Restricted Access
538.45 kBAdobe PDFView/Open

Page view(s)

198
Updated on Jan 30, 2023

Download(s) 50

36
Updated on Jan 30, 2023

Google ScholarTM

Check

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