why square takes longer than multiplication
6 views (last 30 days)
Show older comments
My question is why in matlab square takes more time than multiplication. I read an article, say, square actually can be done a little bit quicker than multiplication. But the test code below doesn't support this. So how does Matlab implement square(and other integer power, which I'm also interested in)? The test code is following:
a=1; tic; for k=1:10000 b=a*a; end toc;
Then, without any changes except "b=a*a" is changed into "b=a^2":
a=1; tic; for k=1:10000 b=a^2; end toc;
Consequently, multiplication takes about 77 microseconds while square takes 500+.
Thanks in advance!! Jerry
0 Comments
Accepted Answer
Walter Roberson
on 6 Dec 2011
The .^ operator is implemented in terms of pow(), which can involve logs. .^ does not appear to optimize .^2
If I recall correctly, there is a File Exchange contribution that decomposes integer powers to create the optimal multiplication series.
3 Comments
Walter Roberson
on 6 Dec 2011
The way to find the code for a built-in MATLAB function is to get a code development job with MathWorks.
I did at one time write code (for my work) that decomposed integer powers into multiplications. Eventually, though, I removed that code again, as I was able to show that the result was lower precision than .^ was able to get.
More Answers (1)
Jan
on 6 Dec 2011
Squaring is cheaper than the multiplication if it is performed in C and if it is implemented using the multiplication (!):
double a = 3.14159265, b;
b = a * a; // Standard
a *= a; // Slightly faster inplace squaring
See Also
Categories
Find more on Logical in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!