python - Find Inflection and Stationary points in a numpy 1d-array -
Assume that I have the following numerical array:
import as numpy import PLT x = NP as matplotlib Piplot. Array ([11.53333333, 11.86666667, 11.1, 10.66666667, 11.2, 11.3, 11.06666667, 12.06666667, 11.8, 13.03333333, 12.4, 12.33333333, 12.53333333, 13.33333333, 12.43333333, 13, 13.2, 13.76666667, 14.96666667, 19.16666667, 25.1, 32. , 83.33333333, 103.776666667, 110.7, 118.63333333, 12 9.26666667, 139.06666667, 150.3, 161.53333333, 171.16666667, 184.56666667, 196.6, 210.26666667, 221.63333333, 231.3, 244.16666667, 253.5, 254.66666667, 255, 255, 255, 255, 255., 255. , 255., 255., 255., 255., 255., 255., 255., 255., 255., 255., 255., 255., 255., 255., 255.]) plt.plot (X) plt.show () Here is the plated output:
How can I easily get in this graph? For example, the first turn is approximately x = 20 and one is equal to x = 37.
Is it possible that all the descending digits are found in descending order, then I am changing the 3 most deadly points later?
Update: I am interested as well as myself as well. Is any simple solution numpy / scipy?
There are very possible answers - which are exactly what you are doing. An idea would be to move the average or splene or something else to smooth the data and then get another derivative, and when this signal changes it will find "infinite points" or "pointing points" - literally, when the concave
See:
Comments
Post a Comment