Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

IMPROV: Strassesn's multiplication method #1191

Closed
wants to merge 2 commits into from

Conversation

sudarshanmg
Copy link

 - Multiplication using strassen's algorithm.
- trying to close melonjs#1181
@obiot
Copy link
Member

obiot commented Jul 16, 2023

that was fast ! I'll try tomorrow :)

Looking at the implementation it is longer than a regular multiplication though, makes me wonder if it actually faster, I'll let you know tomorrow anyway, I'll do some benchmark !

let a = this.val;
let b = m.val;

const A11 = [a[0], a[1], a[4], a[5]];
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is there a way to do the same without creating temporary arrays?

@sudarshanmg
Copy link
Author

sudarshanmg commented Jul 16, 2023

You're right! its taking the same amount of time. (sometimes even longer)

I will try to figure out a way to optimize it. Let me know if you have any ideas (This is new for me). 🥲

@obiot
Copy link
Member

obiot commented Oct 7, 2023

@sudarshanmg did you find the time to look at how to optimise it ? if not I will close this PR for now. Feel free to reopen one if you find a way to do it ? thanks again !

@obiot obiot closed this Oct 7, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

optimize matrix operations using Strassen algorithm ?
2 participants