zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Attracting cycles for the relaxed Newton’s method. (English) Zbl 1215.65089
Authors’ abstract: We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n2, 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. 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 (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.

MSC:
65H04Roots of polynomial equations (numerical methods)
65E05Numerical methods in complex analysis
30C15Zeros of polynomials, etc. (one complex variable)
References:
[1]Milnor, J.: Dynamics in one complex variable: introductory lectures, (2006)
[2]Curry, J. H.; Garnett, L.; Sullivan, D.: On the iteration of a rational function: computer experiment with Newton’s method, Comm. math. Phys. 91, 267-277 (1983) · Zbl 0524.65032 · doi:10.1007/BF01211162
[3]Saupe, D.: Discrete versus continuous Newton’s method: a case study, Acta appl. Math. 13, 59-80 (1988) · Zbl 0669.65037 · doi:10.1007/BF00047502
[4]Kriete, H.: Holomorphic motions in the parameter space for the relaxed Newton’s method, Kodai math. J. 25, 89-107 (2002) · Zbl 1016.37020 · doi:10.2996/kmj/1071674434 · doi:euclid:kmj/1071674434
[5]Vrscay, E.: Julia sets and Mandelbrot-like sets associated with higher order Schröder rational iteration functions: a computer assisted study, Math. comp. 46, No. 173, 151-169 (1986) · Zbl 0597.58013 · doi:10.2307/2008220
[6]Xingyuan, W.; Xuejing, Y.: Julia sets for standard Newton’s method, halley’s method, and Schröder’s method, Appl. math. Comput. 189, 1186-1195 (2007) · Zbl 1122.65348 · doi:10.1016/j.amc.2006.12.002
[7]Vrscay, E.; Gilbert, W.: Extraneous fixed points, basin boundary and chaotic dynamics for Schröder and könig rational iteration functions, Numer. math. 52, 1-16 (1988) · Zbl 0612.30025 · doi:10.1007/BF01401018
[8]Barna, B.: Über die divergenspunkte des newtonschen verfahrens zur bestimmung von wurzeln algebraischen gleichungen. II, Publ. math. Debrecen 4, 384-397 (1956) · Zbl 0073.10603
[9]Plaza, S.; Vergara, V.: Existence of attracting cycles for the Newton’s method, Sci. ser. A math. Sci. 7, 31-36 (2001)
[10]Blanchard, P.: Complex analytic dynamics on the Riemann sphere, Bull. amer. Math. soc. (NS) 11, No. 1, 85-141 (1984) · Zbl 0558.58017 · doi:10.1090/S0273-0979-1984-15240-6
[11]Peitgen, H.; Haeseler, F. V.: Newton’s method and complex dynamical systems, Newton’s method and dynamical systems, 3-58 (1989) · Zbl 0671.30023 · doi:10.1007/BF00047501
[12]Meier, H. -G.: The relaxed Newton-iteration for rational functions: limiting case, Complex var. Theory 16, 239-260 (1991) · Zbl 0731.30019
[13]Von Haeseler, F.; Kriete, H.: The relaxed Newton’s method for rational functions, Random comput. Dyn. 3, 71-92 (1995) · Zbl 0839.58034
[14]Smale, S.: On the efficiency of algorithms of analysis, Bull. amer. Math. soc. (NS) 13, No. 2, 87-121 (1985) · Zbl 0592.65032 · doi:10.1090/S0273-0979-1985-15391-1
[15]Hernández, M. A.; Salanova, M. A.: Indices of convexity and concavity: application to halley method, Appl. math. Comput. 103, 27-49 (1999) · Zbl 0981.65071 · doi:10.1016/S0096-3003(98)10047-4
[16]Mcmullen, C.: Families of rational maps and iterative root-finding algorithms, Ann. of math. 125, 467-493 (1987) · Zbl 0634.30028 · doi:10.2307/1971408