comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: x*x versus x^2
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: x*x versus x^2 [message #61200 is a reply to message #61199] Wed, 09 July 2008 09:57 Go to previous messageGo to previous message
Bruce Bowler is currently offline  Bruce Bowler
Messages: 128
Registered: September 1998
Senior Member
On Wed, 09 Jul 2008 09:43:27 -0700, Conor wrote:

> On Jul 9, 12:32 pm, Conor <cmanc...@gmail.com> wrote:
>> So I've been looking at execution time for various algorithms, and I
>> found this interesting result:
>>
>> bigarr = fltarr(1000,1000)
>>
>> t1 = systime(/seconds)
>> t = bigarr^2.0
>> t2 = systime(/seconds)
>> t = bigarr*bigarr
>> t3 = systime(/seconds)
>>
>> print,t2-t1
>> print,t3-t2
>>
>> IDL prints:
>>
>> 0.024163008
>> 0.010262012
>>
>> Apparently multiplying an array by itself is twice as fast as using the
>> carat operator! Anyone know why this is? Is it a memory issue or
>> something?
>
> This also holds true for array's smaller than the multi-threading
> minimum size, so it isn't because multi-threading is being used in one
> case but not the other...

Digging into the deep dark recesses of my brain...

exponentiation with a real exponent generally uses the log function to do
it's thing. *some* language implementations are smart enough that if the
exponent is an integer, they decompose the exponentiation into
multiplication.

It might be worth trying your experiment with t=bigarr^2 and see how the
results change.

Bruce
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Re: newbie wants to call IDL from shell
Next Topic: Re: IDL Adventure!?

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 14:45:44 PDT 2025

Total time taken to generate the page: 1.76128 seconds