Skip to main content
AI Assist is now on Stack Overflow. Start a chat to get instant answers from across the network. Sign up to save and share your chats.

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • 1
    Probably a duplicate of How to find the local minima of a smooth multidimensional array in NumPy efficiently?. Commented Jan 7, 2011 at 11:25
  • 2
    No that's in 2D (I am talking about 1D) and involves custom functions. I have my own simple implementation, but I was wondering if there is a better one, that comes with Numpy/Scipy modules. Commented Jan 7, 2011 at 11:31
  • Maybe you could update the question to include that (1) you have a 1d array and (2) what kind of local minimum you are looking for. Just an entry smaller than the two adjacent entries? Commented Jan 7, 2011 at 11:35
  • 1
    You can have a look at scipy.signal.find_peaks_cwt if you are talking of data with noise Commented Jun 17, 2015 at 20:46