Numerical analysis: an introduction
Numerical analysis: an introduction
Optimal Order of One-Point and Multipoint Iteration
Journal of the ACM (JACM)
A class of quasi-Newton generalized Steffensen methods on Banach spaces
Journal of Computational and Applied Mathematics
The convergence ball of the Secant method under Hölder continuous divided differences
Journal of Computational and Applied Mathematics
Improvements of the efficiency of some three-step iterative like-Newton methods
Numerische Mathematik
Convergence and numerical analysis of a family of two-step steffensen's methods
Computers & Mathematics with Applications
Accurate fourteenth-order methods for solving nonlinear equations
Numerical Algorithms
| Hi-index | 7.29 |
In this paper a zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to compose a given iterative method with a modified Newton's method that introduces just one evaluation of the function. To carry out this procedure some classical methods with different orders of convergence are used to obtain new methods that can be generalized in Banach spaces.