Fibonacci Search
A very similar algorithm can also be used to find the extremum (minimum or maximum) of a sequence of values that has a single local minimum or local maximum. In order to approximate the probe positions of golden section search while probing only integer sequence indices, the variant of the algorithm for this case typically maintains a bracketing of the solution in which the length of the bracketed interval is a Fibonacci number. For this reason, the sequence variant of golden section search is often called Fibonacci search.
Fibonacci search was first devised by Kiefer (1953) as a minimax search for the maximum (minimum) of a unimodal function in an interval.
Read more about this topic: Golden Section Search
Famous quotes containing the word search:
“The danger lies in forgetting what we had. The flow between generations becomes a trickle, grandchildren tape-recording grandparents’ memories on special occasions perhaps—no casual storytelling jogged by daily life, there being no shared daily life what with migrations, exiles, diasporas, rendings, the search for work. Or there is a shared daily life riddled with holes of silence.”
—Adrienne Rich (b. 1929)