A globally convergent method for simultaneously finding polynomial roots
نویسندگان
چکیده
منابع مشابه
A Globally Convergent Method for Simultaneously Finding Polynomial Roots*
A new method for the simultaneous approximation of all the roots of a polynomial is given. The method converges for almost every initial approximation, the set of the exceptional starting points being a closed set of measure zero, at least if all the polynomial roots are real and simple. The method exhibits quadratic convergence not only to simple, but also to multiple roots.
متن کاملOn fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations
In this paper, we present and analyse fourth order method for finding simultaneously multiple zeros of polynomial equations. S. M. Ilič and L. Rančič modified cubically convergent Ehrlich Aberth method to fourth order for the simultaneous determination of simple zeros [5]. We generalize this method to the case of multiple zeros of complex polynomial equations. It is proved that the method has f...
متن کاملFinding roots of real polynomial simultaneously bymeans of Bairstow ' s method
Aberth's method for nding the roots of a polynomial was shown to be robust. However, complex arithmetic is needed in this method even if the polynomial is real, because it starts with complex initial approximations. A novel method is proposed for real polynomials that does not require any complex arithmetic within iterations. It is based on the observation that Aberth's method is a systematic u...
متن کاملA Globally Convergent Filter Method for MPECs
We propose a new method for mathematical programs with complementarity constraints that is globally convergent to B-stationary points. The method solves a linear program with complementarity constraints to obtain an estimate of the active set. It then fixes the activities and solves an equality-constrained quadratic program to obtain fast convergence. The method uses a filter to promote global ...
متن کاملA Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems
POLYNOMIAL systems of equations frequently arise in solid modelling, robotics, computer vision, chemistry, chemical engineering, and mechanical engineering. Locally convergent iterative methods such as quasi-Newton methods may diverge or fail to find all meaningful solutions of a polynomial system. This paper proposes a parallel homotopy algorithm for polynomial systems of equations that is gua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1985
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1985-0771036-6