Abstract
In this paper we deal with the problem of locating all the zeros of a given polynomialp(x) and approximating them to any degree of precision: by combining classical iterative methods with homotopy path tracking techniques, we introduce a new algorithm for polynomial root finding, prove its convergence and estimate its computational cost.
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.
