Abstract
For the numerical determination of zeros of a complex polynomial by simultaneous iterative methods, we show theorems on the fact that the approximations for a multiple zero gather around the exact zero when they become close approximations. Application of our theorems makes it possible to estimate the multiplicity of zeros dynamically as well as to improve the convergence to multiple zeros for the known methods, e.g. Durand-Kerner's or Tanabe's methods.
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.
