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

Home » Public Forums » archive » How to speed up kernel density smoothing for many data points
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: How to speed up kernel density smoothing for many data points [message #86133 is a reply to message #86132] Thu, 10 October 2013 06:29 Go to previous messageGo to previous message
jacobsvensmark is currently offline  jacobsvensmark
Messages: 7
Registered: October 2013
Junior Member
On Thursday, October 10, 2013 3:03:15 PM UTC+2, Moritz Fischer wrote:
> ...and taking a look at K:
>
> check out the COMPLEMENT keyword to WHERE!
>
> Note that RES[aa] = 0. is redundant (it gets initialized with zeros)!
>
> --m
>
>
>
>
>
> Am 10.10.2013 14:22, schrieb :
>
>> Okay so I have a long array of N 2D points:

Hey,

Thanks, I removed the RES[aa] = 0, good point. That will give some speed. And thanks for your help with the matrix_euclidean_distance program - I tested it out, and for N=1000 it runs instantly, but for N=10000, its very slow and becomes unresponsive, and for N=100000 it just spits out "% Array has too many elements". Makes sense because I guess your program effectively makes a NxN matrix from the N points...
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Newline in WIDGET_LABEL
Next Topic: CMIP5 files - time

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

Current Time: Sun Oct 12 13:11:50 PDT 2025

Total time taken to generate the page: 1.92065 seconds