MathGroup Archive 1998

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Find Max of "Concave" List

  • To: mathgroup at
  • Subject: [mg13000] Re: Find Max of "Concave" List
  • From: Tobias Oed <tobias at>
  • Date: Sun, 28 Jun 1998 02:52:21 -0400
  • Organization: Old Dominion University
  • References: <6mqcvs$>
  • Sender: owner-wri-mathgroup at

Chris Farr wrote:

> I have a one-dimensional list which is concave.  That is, if you did a
> ListPlot on the list you would have a concave curve.
> Given the concavity, when finding the max, it is inefficient to use
> Max[] which does a comparison on all elements of the list.
> Is there an elegant way to exploit the concavity when performing a
> Max[]?  That is, the algorithm should stop when the next element in the
>  list is lower then the previous element.  This would limit the number
> of  comparisons.
> Thanks,
> Chris Farr

  maybe something like




  • Prev by Date: Re: Strange behavior of Sort
  • Next by Date: Re: Trigonometric equation????
  • Previous by thread: Re: Find Max of "Concave" List
  • Next by thread: How to Extract a common factor from a Sum