Abstract
In this paper, we propose a fifth-order family of iterative methods for approximation of all zeros of a polynomial simultaneously. The new family is developed by combining Gander’s third-order family of iterative methods with the second-order Weierstrass root-finding method. The aim of the paper is to state initial conditions that provide local and semilocal convergence of the proposed methods as well as a priori and a posteriori error estimates. In the case of semilocal convergence the initial conditions and error estimates are computationally verifiable which is of practical importance.
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.