A fast way to compute matrix multiplication
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 t...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/141584 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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. |
|---|