Abstract
In this paper, we provide a detailed local convergence analysis of the Ehrlich method for numerical computation of all zeros of a polynomial simultaneously. Our results generalize and improve the results of Kyurkchiev and Tashev (C. R. Acad. Bulg. Sci. 34:1053---1055, 1981), Wang and Zhao (Computing 43:187---197, 1989) and Tilli (Calcolo 35:3---15, 1998).
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.
