TheNewton fractal is aboundary set in thecomplex plane which is characterized byNewton's method applied to a fixedpolynomialp(z) ∈[z] ortranscendental function. It is theJulia set of themeromorphic functionz ↦z −p(z)/p′(z) which is given by Newton's method. When there are no attractive cycles (of order greater than 1), it divides the complex plane into regionsGk, each of which is associated with arootζk of the polynomial,k = 1, …, deg(p). In this way the Newton fractal is similar to theMandelbrot set, and like other fractals it exhibits an intricate appearance arising from a simple description. It is relevant tonumerical analysis because it shows that (outside the region ofquadratic convergence) the Newton method can be very sensitive to its choice of start point.

Almost all points of the complex plane are associated with one of thedeg(p) roots of a given polynomial in the following way: the point is used as starting valuez0 for Newton's iterationzn + 1 :=zn −p(zn)/p'(zn), yielding a sequence of pointsz1,z2, …, If the sequence converges to the rootζk, thenz0 was an element of the regionGk. However, for every polynomial of degree at least 2 there are points for which the Newton iteration does not converge to any root: examples are the boundaries of the basins of attraction of the various roots. There are even polynomials for which open sets of starting points fail to converge to any root: a simple example isz3 − 2z + 2, where some points are attracted by the cycle0, 1, 0, 1… rather than by a root.
An open set for which the iterations converge towards a given root or cycle (that is not a fixed point), is aFatou set for the iteration. The complementary set to the union of all these, is the Julia set. The Fatou sets have common boundary, namely the Julia set. Therefore, each point of the Julia set is a point of accumulation for each of the Fatou sets. It is this property that causes the fractal structure of the Julia set (when the degree of the polynomial is larger than 2).
To plot images of the fractal, one may first choose a specified numberd of complex points(ζ1, …,ζd) and compute the coefficients(p1, …,pd) of the polynomial
- .
Then for a rectangular lattice
of points in, one finds the indexk(m,n) of the corresponding rootζk(m,n) and uses this to fill anM ×N raster grid by assigning to each point(m,n) a colorfk(m,n). Additionally or alternatively the colors may be dependent on the distanceD(m,n), which is defined to be the first valueD such that|zD −ζk(m,n)| <ε for some previously fixed smallε > 0.
Generalization of Newton fractals
editA generalization of Newton's iteration is
wherea is anycomplex number.[1] The special choicea = 1 corresponds to the Newton fractal. The fixed points of this map are stable whena lies inside the disk of radius 1 centered at 1. Whena is outside this disk, the fixed points are locally unstable, however the map still exhibits a fractal structure in the sense ofJulia set. Ifp is a polynomial of degreed, then the sequencezn isbounded provided thata is inside a disk of radiusd centered atd.
More generally, Newton's fractal is a special case of aJulia set.
- Newton fractal for three degree-3 rootsp(z) =z3 − 1, coloured by number of iterations required
- Newton fractal for three degree-3 rootsp(z) =z3 − 1, coloured by root reached
- Newton fractal forp(z) =z3 − 2z + 2. Points in the red basins do not reach a root.
- Newton fractal for a 7th order polynomial, colored by root reached and shaded by rate of convergence.
- Newton fractal forp(z) =z8 + 15z4 − 16
- Newton fractal forp(z) =z5 − 3iz3 − (5 + 2i)z2 + 3z + 1, coloured by root reached, shaded by number of iterations required.
- Newton fractal forp(z) = sinz, coloured by root reached, shaded by number of iterations required
- Another Newton fractal forp(z) = sinz
- Generalized Newton fractal forp(z) =z3 − 1,a = −1/2. The colour was chosen based on the argument after 40 iterations.
- Generalized Newton fractal forp(z) =z2 − 1,a = 1 +i.
- Generalized Newton fractal forp(z) =z3 − 1,a = 2.
- Generalized Newton fractal forp(z) =z4 + 3i − 1,a = 2.1.
- p(z) =z6 +z3 - 1
- p(z) = sinz - 1
- p(z) = sinz - 1
- p(z) = coshz - 1
- p(z) = coshz - 1
- p(z) =z20 - 2z + 2
Serie :p(z) =zn- 1
- p(z) =z3 - 1, a=1
- p(z) =z3 - 1, a=2
- p(z) =z4 - 1, a=1
- p(z) =z4 - 1, a=2
- p(z) =z5 - 1, a=1
- p(z) =z5 - 1, a=2
- p(z) =z6 - 1, a=1
- p(z) =z7 - 1, a=1
- p(z) =z8 - 1, a=1
- p(z) =z10 - 1, a=1
Other fractals where potential and trigonometric functions are multiplied.p(z) =zn*Sin(z) - 1
- p(z) =z2*Sin(Z) - 1, a=1
- p(z) =z2*Sin(Z) - 1, a=1 (zoom)
- p(z) =z3*Sin(Z) - 1, a=1
- p(z) =z4*Sin(Z) - 1, a=1
- p(z) =z4*Sin(Z) - 1, a=1 (zoom)
- p(z) =z5*Sin(Z) - 1, a=1
- p(z) =z6*Sin(Z) - 1, a=1
- p(z) =z6*Sin(Z) - 1, a=1 (zoom)
Nova fractal
editThe Nova fractal invented in the mid 1990s by Paul Derbyshire,[2][3] is a generalization of the Newton fractal with the addition of a valuec at each step:[4]
The "Julia" variant of the Nova fractal keepsc constant over the image and initializesz0 to the pixel coordinates. The "Mandelbrot" variant of the Nova fractal initializesc to the pixel coordinates and setsz0 to a critical point, where[5]
Commonly-used polynomials likep(z) =z3 − 1 orp(z) = (z − 1)3 lead to a critical point atz = 1.
- Animated "Julia" Nova fractal forp(z) =z3 − 1 withc going from −1 to 1, colored by root reached.
- Animated "Julia" Nova fractal forp(z) =z3 − 1 withc =1/2eiφ andφ going from 0 to 2π, colored by root reached.
Implementation
editIn order to implement the Newton fractal, it is necessary to have a starting function as well as its derivative function:
The three roots of the function are
The above-defined functions can be translated inpseudocode as follows:
//z^3-1float2Function(float2z){returncpow(z,3)-float2(1,0);//cpow is an exponential function for complex numbers}//3*z^2float2Derivative(float2z){return3*cmul(z,z);//cmul is a function that handles multiplication of complex numbers}
It is now just a matter of implementing the Newton method using the given functions.
float2roots[3]=//Roots (solutions) of the polynomial{float2(1,0),float2(-.5,sqrt(3)/2),float2(-.5,-sqrt(3)/2)};colorcolors[3]=//Assign a color for each root{red,green,blue}Foreachpixel(x,y)onthetarget,do:{zx=scaledxcoordinateofpixel(scaledtolieintheMandelbrotXscale(-2.5,1))zy=scaledycoordinateofpixel(scaledtolieintheMandelbrotYscale(-2,1))float2z=float2(zx,zy);//z is originally set to the pixel coordinatesfor(intiteration=0;iteration<maxIteration;iteration++;){z-=cdiv(Function(z),Derivative(z));//cdiv is a function for dividing complex numbersfloattolerance=0.000001;for(inti=0;i<roots.Length;i++){float2difference=z-roots[i];//If the current iteration is close enough to a root, color the pixel.if(abs(difference.x)<tolerance&&abs(difference.y)<tolerance){returncolors[i];//Return the color corresponding to the root}}}returnblack;//If no solution is found}
See also
editReferences
edit- ^Simon Tatham."Fractals derived from Newton–Raphson".
- ^Damien M. Jones."class Standard_NovaMandel (Ultra Fractal formula reference)".
- ^Damien M. Jones."dmj's nova fractals 1995-6".
- ^Michael Condron."Relaxed Newton's Method and the Nova Fractal".
- ^Frederik Slijkerman."Ultra Fractal Manual: Nova (Julia, Mandelbrot)".
Further reading
edit- J. H. Hubbard, D. Schleicher, S. Sutherland:How to Find All Roots of Complex Polynomials by Newton's Method, Inventiones Mathematicae vol. 146 (2001) – with a discussion of the global structure of Newton fractals
- On the Number of Iterations for Newton's Method by Dierk Schleicher July 21, 2000
- Newton's Method as a Dynamical System by Johannes Rueckert
- Newton's Fractal (which Newton knew nothing about) by3Blue1Brown, along with an interactive demonstration of the fractal onhis website, and thesource code for the demonstration