A fast way to calculate multiplication with large inputs
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 ma...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/78516 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | 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. |
|---|