Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Any idea for predicting the peak points in the graph by perl

by pvaldes (Chaplain)
on Jul 15, 2012 at 10:22 UTC ( #981890=note: print w/ replies, xml ) Need Help??


in reply to Any idea for predicting the peak points in the graph by perl

Not, this is not the right way

What you want probably is to find (to predict) the critic points of the function defined by your sample points. Obtaining the maximum point of the sample is not of much value because what is really interesting in the graph is the curve of the function that fits better your points. Its maximum and minimun points can be (and probably will be) between two given points

You probably need instead

use Math:Derivative;

increase gradually and then decrease gradually

Clearly your teacher was trying to tell you something with this words. A requisite to be able to find what you want is that your function is continuous

EDIT: Well I see now that a lot of the last messages point to this yet. Your problem is a math problem, not a "sort this array" problem


Comment on Re: Any idea for predicting the peak points in the graph by perl
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://981890]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (8)
As of 2014-07-22 09:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (109 votes), past polls