Abstract
Many multipoint iterative methods without memory for solving non-linear equations in one variable are found in the literature. In particular, there are methods that provide fourth-order, eighth-order or sixteenth-order convergence using only, respectively, three, four or five function evaluations per iteration step, thus supporting the Kung-Traub conjecture on the optimal order of convergence. This paper shows how to find optimal high order root-finding iterative methods by means of a general scheme based in weight functions. In particular, we explicitly give an optimal thirty-second-order iterative method; as long as we know, an iterative method with that order of convergence has not been described before. Finally, we give a conjecture about optimal order multipoint iterative methods with weights.
Highlights
Introduction and Main ResultsSolving nonlinear equations is a basic and extremely valuable tool in all fields of science and engineering
Given a function f : D ⊂ C → C defined on a region D in the complex plane C, one of the most common methods for finding simple roots x∗ of a nonlinear equation f (x) = 0 is Newton’s method which, starting at an initial guess x0, iterates by means of xn+1 = N f := xn −
When x∗ is unknown, which is usual in practice, we can use the approximated computational order of convergence (ACOC), defined in [9], as ln |(xn+1 − xn)/(xn − xn−1)| ln |(xn − xn−1)/(xn−1 − xn−2)|
Summary
Solving nonlinear equations is a basic and extremely valuable tool in all fields of science and engineering.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.