This is the mail archive of the
gsl-discuss@sources.redhat.com
mailing list for the GSL project.
Re: minimization using the Brent algorithm (brent.c)
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: Faheem Mitha <faheem at email dot unc dot edu>
- Cc: gsl-discuss at sources dot redhat dot com
- Date: Sun, 16 Mar 2003 11:02:38 +0000
- Subject: Re: minimization using the Brent algorithm (brent.c)
- References: <Pine.LNX.4.44.0303121303470.16046-100000@Chrestomanci>
Faheem Mitha writes:
> I need to use a one-dimensional global minimization algorithm (to minimize
> a function on an interval). However, this algorithm is embedded inside a
> larger framework, and needs to be called many times without user
> intervention. I discovered that an implementation of this algorithm was in
> GSL, so I decided to use it.
>
The GSL minimization routines are designed for finding a guaranteed
bound on a local minimum f(a)>f(x)<f(b). They don't cover the case of
a minimum occuring at an endpoint.
If you want to make use of the brent algorithm, you could copy it from
GSL into your own program, rather than modifying the library itself.
regards,
--
Brian Gough
----------------------------------------------------------------------
Network Theory Ltd Phone: +44 117 3179309 (UK: 0117 3179309)
15 Royal Park Fax: +44 117 9048108 (UK: 0117 9048108)
Bristol BS8 3AL WWW: http://www.network-theory.co.uk/
United Kingdom Email: bjg at network-theory dot co dot uk
----------------------------------------------------------------------