A fast way for matrix multiplication
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 th...
Main Author: | Oh, Yi Hong |
---|---|
Other Authors: | Shu Jian Jun |
Format: | Final Year Project (FYP) |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/75540 |
Similar Items
-
A fast way to compute matrix multiplication
by: Khor, Yu Feng
Published: (2020) -
A fast way to calculate multiplication with large inputs
by: Huang, Lixin
Published: (2019) -
Design of fast climbing robot for tree with multiple diverging branche
by: Ahmad Najmuddin, Ibrahim, et al.
Published: (2018) -
Accelerating binary-matrix multiplication on FPGA
by: Liwongan, Ricardo Jack
Published: (2017) -
An improved scoring matrix for multiple sequence alignment
by: Shu, Jian-Jun, et al.
Published: (2014)