In my code for multiplying 400 matrices 1000 times, I find that the normal matrix multiplication method (brutal force method) is being computed in a much faster way than the divide and conquer algorithm. Can anyone please suggest me what the prob is?

1 view (last 30 days)
Anwaya rath
Anwaya rath on 22 Jun 2017
Edited: Anwaya rath on 22 Jun 2017
In my code for multiplying 400 matrices 1000 times, I find that the normal matrix multiplication method (brutal force method) is being computed in a quicker time than the divide and conquer algorithm (by 3 seconds.) . Can anyone please suggest me what the prob is?

Sign in to answer this question.

Answers (0)

Categories

Find more on MATLAB in Help Center and File Exchange

Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!