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

Home » Public Forums » archive » efficient kernel or masking algorithm ?
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: efficient kernel or masking algorithm ? [message #22773 is a reply to message #22645] Thu, 30 November 2000 00:00 Go to previous message
Craig Markwardt is currently offline  Craig Markwardt
Messages: 1869
Registered: November 1996
Senior Member
"J.D. Smith" <jdsmith@astro.cornell.edu> writes:
...
> While I'm on the gripe train, why shouldn't we be able to consistently
> perform operations along any dimension of an array we like with relevant
> IDL routines. E.g., we can total along a single dimension. All due
> respect to Craig's CMAPPLY function, but some of these things should be
> much faster. Resorting to summed logarithms for multiplication is not
> entirely dubious, but why shouldn't we be able to say:
...

Agree! Agree! Agree! For once we are griping in synchrony :-)

These are exactly the kinds of operations that would be enhanced by
vectorization, but they can't as IDL stands now.

By the way, CMAPPLY doesn't use summed logarithms any more. It uses
my bestest algorithm that came out of the recent newsgroup discussion.

Craig

--
------------------------------------------------------------ --------------
Craig B. Markwardt, Ph.D. EMAIL: craigmnet@cow.physics.wisc.edu
Astrophysics, IDL, Finance, Derivatives | Remove "net" for better response
------------------------------------------------------------ --------------
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Previous Topic: How Computers Represent Floats
Next Topic: Re: Object Graphics+Win2k+nVidia Lockups

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

Current Time: Sat Oct 11 08:17:44 PDT 2025

Total time taken to generate the page: 0.56005 seconds