Abstract
We generalize a hybrid algorithm of binary search and Newton′s method to compute real roots for a class of real functions. We show that the algorithm computes a root inside (0, R] with error ϵ in O(log log( R/ϵ)) time, where one function evaluation or one arithmetic operation counts for one unit of time. This work is based on Smale′s criterion for using Newton′s method and Renegar′s result of approximating roots of polynomials.
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.
