Attracting cycles for the relaxed Newton's method

Attracting cycles for the relaxed Newton's method

0.00 Avg rating0 Votes
Article ID: iaor20112913
Volume: 235
Issue: 10
Start Page Number: 3238
End Page Number: 3244
Publication Date: Mar 2011
Journal: Journal of Computational and Applied Mathematics
Authors: ,
Keywords: heuristics, heuristics: local search, programming: nonlinear
Abstract:

We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n = 2 equ1, we may construct a polynomial so that when the method is applied to a polynomial, the resulting rational function has an attracting cycle of period n equ2. We show that when we use the method to extract radicals, the set consisting of the points at which the method fails to converge to the roots of the polynomial p ( z ) = z m c equ3 (this set includes the Julia set) has zero Lebesgue measure. Consequently, iterate sequences under the relaxed Newton’s method converge to the roots of the preceding polynomial with probability one.

Reviews

Required fields are marked *. Your email address will not be published.