McMullen’s root-finding algorithm for cubic polynomials
نویسندگان
چکیده
منابع مشابه
Mcmullen’s Root-finding Algorithm for Cubic Polynomials
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
متن کاملP -adic root separation for quadratic and cubic polynomials
We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible cubic polynomials are completely understood, while in the irreducible cubic case, we give a family of polynomials with the bound which is the best currently known.
متن کاملChaotic Root-Finding for a Small Class of Polynomials
In this paper we present a new closed-form solution to a chaotic difference equation, yn+1 = a2y 2 n + a1yn + a0 with coefficient a0 = (a1 − 4)(a1 + 2)/(4a2), and using this solution, show how corresponding exact roots to a special set of related polynomials of order 2, p ∈ N with two independent parameters can be generated, for any p.
متن کاملChaotic Root-Finding for a Small Class of Polynomials
In this paper we present a new closed-form solution to a chaotic difference equation, yn+1 = a2y 2 n + a1yn + a0 with coefficient a0 = (a1 − 4)(a1 + 2)/(4a2), and using this solution, show how corresponding exact roots to a special set of related polynomials of order 2, p ∈ N with two independent parameters can be generated, for any p.
متن کاملEfficient Root Finding of Polynomials over Fields of Characteristic 2
Root finding is the most time-consuming stage of McEliece cryptosystem decryption. The best method to find the zeroes of a polynomial for cryptographic parameters is the Berlekamp Trace Algorithm (BTA). Our idea is to mix BTA with ad-hoc methods proposed by Zinoviev. We obtain a significant gain in terms of time complexity for finding roots and so we decrease McEliece decryption time. This pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2002
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-02-06659-5