Abstract
We study the average case behavior of suitable algorithms to solve a nonlinear problem in numerical analysis: determining zeroes of increasing Lipschitz functions of one variable. The bisection method (which is optimal with respect to the maximal error over the whole class of functions) is far from being optimal in a more general sense: There are methods which behave like bisection in the worst case but which yield much better results on the average. We prove that the sequentially optimal algorithm found by Sukharev is also optimal in our average case setting.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
