Abstract
Using classical Weierstrass' result concerning polynomial zeros in a suitable interval form and some iterative method in floating-point arithmetic, a hybrid method for finding an isolated simple complex zero of a polynomial is established. This method possesses a high computational efficiency and the capability of automatic determination of error bounds of the approximate solution. A computationally verifiable test for the existence of a polynomial complex zeros in a given disk is also presented.
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.
