Golden Section Search

The Golden Section Search is used to find the maximum or minimum of a continuous, unimodal function. A unimodal function is a function which contains only one minimum or maximum on an interval [a,b].

The Golden Section Search technique successively narrows a range of values inside a function where the extrenum is know to exist. The algorithm maintains the function values for triples of points whose distances form a golden ratio.

The Golden Section Search app executes the search only for the Minimum values.

The Golden Section Search iPad app provides for a slider data entry technique for the interval [a,b] with a range of [-10.0,10.0].

Interval [a,b] is the lower endpoint of the initial interval which contains a local minimum. For output Interval [a1,b1] is the lower endpoint of the final subinterval which contains the local minimum. Function values [f(a), f(b), f(a1) and f(b1)] are computed.

A graph displays the Interval and Function values.