Abstract
An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petkovie’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + \(\sqrt 7 \) ≈ 4.646 or 5, depending of the type of applied inversion of a disk. The proposed algorithm possesses great computational efficiency since the increase of the convergence rate is obtained without additional calculations. Initial conditions which provide the guaranteed convergence of the considered method are also studied. These conditions are computationally verifiable, which is of practical importance.
Sign-in/Register to access full text options 
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.
