cmplx(0.,-x) or -j*x

Hi,

Is there any speed advantage of using

z = cmplx(0,-x) over z = -j*x (or vice-versa)

where x is real and possible an array and j=sqrt(-1). Would this be
something that is compiler dependent?

Thanks,
John

.

Relevant Pages

  • Re: cmplx(0.,-x) or -j*x
    ... > Is there any speed advantage of using ... > where x is real and possible an array and j=sqrt. ... Prev by Date: ...
    (comp.lang.fortran)
  • Re: IF with nested AND
    ... Worked just fine for me with array entered. ... John C ... "Joco" wrote: ... which only works for the first cell in the ...
    (microsoft.public.excel.misc)
  • Re: Use of ANY
    ... I'd like to know the fastest way to do a check on all elements of a slice of an array, looking for any occurrence of a particular condition. ... The difference between "unusual" and "almost always" is processor and compiler dependent. ... Dick Hendrickson ... But, it's also likely that the compiler will generate efficient code for the implied loop. ...
    (comp.lang.fortran)
  • Re: my doesnt totally isolate
    ... John> Hmmm.... ... So how am I supposed to distinguish between an array ... what control you see is an undocumented side effect and may go ... allocation and undef. ...
    (comp.lang.perl.misc)
  • Re: Use of ANY
    ... I'd like to know the fastest way to do a check on all elements of a slice of an array, looking for any occurrence of a particular condition. ... The difference between "unusual" and "almost always" is processor and compiler dependent. ... I was going to whimsically suggest that you write it both ways in an if-else block, using COUNT (test expression) < small_number as the IF condition. ... But, it's also likely that the compiler will generate efficient code for the implied loop. ...
    (comp.lang.fortran)