Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1998
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1998

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

Search the Archive

Find Max of "Concave" List

  • To: mathgroup at smc.vnet.net
  • Subject: [mg12918] Find Max of "Concave" List
  • From: "Chris Farr" <farr at brown.edu>
  • Date: Wed, 24 Jun 1998 03:44:38 -0400
  • Sender: owner-wri-mathgroup at wolfram.com

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



  • Prev by Date: Re: Position on a List
  • Next by Date: How to Extract a common factor from a Sum
  • Previous by thread: Re: Numerical Determinants
  • Next by thread: Re: Find Max of "Concave" List