Combining binary search and Newton's method to compute real roots for a class of real functions
From MaRDI portal
Publication:1336478
DOI10.1006/jcom.1994.1014zbMath0844.65045MaRDI QIDQ1336478
Publication date: 29 August 1996
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1994.1014
complexity; Newton's method; real functions; real roots; bisection method; hybrid algorithm; binary search; Smale type condition
65H05: Numerical computation of solutions to single equations
65Y20: Complexity and performance of numerical algorithms
Related Items
The trust region subproblem and semidefinite programming*, A new solution method for the finite-horizon discrete-time EOQ problem, On the complexity of approximating a KKT point of quadratic programming, Some speed-ups and speed limits for real algebraic geometry, On solving univariate sparse polynomials in logarithmic time, Solving degenerate sparse polynomial systems faster