Lowering the Golden Ratio: The Impact on Golden Section Search Efficiency

[Prinzmio]

Currently my task is to count number of iterations of golden section search verus interval bisection search of a function y = x^2. Golden section search took about twice the number of iterations than interval bisection search.

If I lowered the golden ratio from 0.618 to 0.5562 , the number of iterations get improved, from 40 iterations to 32.

Could you please advise, why lowering golden ratio improves efficiency of golden section search? If lowering ratio means better performance, what is the advantage of Golden section search verus interval bisection search?

 

[Baluncore]

A golden-section search is used to find a maximum or a minimum over a specified range.
Over what range of x are you searching?
What extreme is there to find in the range?