comp.lang.idl-pvwave archive: archive » Re: A better way to find a dip (local minimum with certain conditions)

Home » Public Forums » archive » Re: A better way to find a dip (local minimum with certain conditions)

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: A better way to find a dip (local minimum with certain conditions) [message #69040 is a reply to message #69037]

Wed, 16 December 2009 13:39

rogass
Messages: 200
Registered: April 2008

Senior Member

Hi David,
as i understood the following might work (untested):

FUNCTION finddip,array,minim,range=range
range=keyword_set(range)? 0>range<n_elements(array) : 4
minimum = (min(array-minim,wheremin,/nan))[0] ; [0]-> to get only
the first match
if wheremin ne -1 then begin
ar = array[-1>(wheremin-range):(wheremin+range)<(n_elements
(array)-1)]
if max(((arr=ar[sort(ar)]-ar))) eq min(arr) then return,wheremin
endif else return,-1
end

Maybe it works and maybe that the principle behind gives you a hint
for solving the problem

Regards

CR

Report message to a moderator

[Message index]

		Re: A better way to find a dip (local minimum with certain conditions) By: Giorgio on Wed, 16 December 2009 15:58
		Re: A better way to find a dip (local minimum with certain conditions) By: rogass on Wed, 16 December 2009 13:39
		Re: A better way to find a dip (local minimum with certain conditions) By: DavidPS on Mon, 21 December 2009 10:44

Previous Topic:	build project to executable .sav binary eclipse
Next Topic:	Re: Place cursor programatically in draw widget?

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sun Oct 12 17:06:35 PDT 2025

Total time taken to generate the page: 2.72122 seconds