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

AI Thread Summary
The discussion centers on comparing the efficiency of the golden section search and interval bisection search methods for optimizing the function y = x^2. It was observed that the golden section search required approximately twice as many iterations as the interval bisection search. However, adjusting the golden ratio from 0.618 to 0.5562 resulted in a reduction of iterations from 40 to 32, suggesting that a lower ratio can enhance the efficiency of the golden section search. The conversation raises questions about the reasons behind this improved performance and seeks to clarify the advantages of the golden section search over the interval bisection method, particularly in terms of its application for finding maxima or minima within a specified range. Additionally, inquiries are made regarding the specific range of x being analyzed and the extremes that need to be identified within that range.
Prinzmio
Messages
1
Reaction score
0
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?
 
Technology news on Phys.org
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?
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
I tried a web search "the loss of programming ", and found an article saying that all aspects of writing, developing, and testing software programs will one day all be handled through artificial intelligence. One must wonder then, who is responsible. WHO is responsible for any problems, bugs, deficiencies, or whatever malfunctions which the programs make their users endure? Things may work wrong however the "wrong" happens. AI needs to fix the problems for the users. Any way to...
Back
Top