Abstract
How many tests does one have to perform in order to compute an ε-approximation of a zero of a function f out of a given class of continuous functions on the unit interval, for a given ε>0? We study this question in the context of the real number oracle machine model which uses the four standard arithmetic operations, comparisons with zero, and function values at adaptively chosen points. Let 0< ε< 1 2 . We show that for the class of all continuous functions f on the unit interval with f(0)<0 and f(1)>0 one needs exactly ⌈log 2(1/(2 ε))⌉ tests in the worst case during a computation. For the subclass of all functions which are additionally nondecreasing one needs roughly log 2 log 2 ε −1 tests, and for the subclass of all functions which are additionally increasing one needs exactly 1 test.
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.
