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...
Saved in:
Main Author: | Oh, Yi Hong |
---|---|
Other Authors: | Shu Jian Jun |
Format: | Final Year Project |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/75540 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
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) -
Finite element vibration analysis using bar and beam elements with a new method for lumping mass matrix
by: Tan, Jia Yi
Published: (2019) -
Buckling of pre-twisted threads embedded in a soft matrix
by: Liow, Zhen Yi
Published: (2023) -
Preparation and characterization of mixed matrix membranes based on poly(vinylidene fluoride) and zeolite 4A for gas separation
by: Shen, Yi., et al.
Published: (2013)