The Newton fractal is a boundary set in the complex plane which is characterized by Newton's method applied to a fixed polynomial p(z) ∈ [z] or transcendental function. It is the Julia set of the meromorphic function z ↦ 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 regions G_{k}, each of which is associated with a root ζ_{k} of the polynomial, k = 1, …, deg(p). In this way the Newton fractal is similar to the Mandelbrot set, and like other fractals it exhibits an intricate appearance arising from a simple description. It is relevant to numerical analysis because it shows that (outside the region of quadratic 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 the deg(p) roots of a given polynomial in the following way: the point is used as starting value z_{0} for Newton's iteration z_{n + 1} := z_{n} − p(z_{n})/p'(z_{n}), yielding a sequence of points z_{1}, z_{2}, …, If the sequence converges to the root ζ_{k}, then z_{0} was an element of the region G_{k}. 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 is z^{3} − 2z + 2, where some points are attracted by the cycle 0, 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 a Fatou 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 number d of complex points (ζ_{1}, …, ζ_{d}) and compute the coefficients (p_{1}, …, p_{d}) of the polynomial
Then for a rectangular lattice
of points in , one finds the index k(m,n) of the corresponding root ζ_{k(m,n)} and uses this to fill an M × N raster grid by assigning to each point (m,n) a color f_{k(m,n)}. Additionally or alternatively the colors may be dependent on the distance D(m,n), which is defined to be the first value D such that |z_{D} − ζ_{k(m,n)}| < ε for some previously fixed small ε > 0.
A generalization of Newton's iteration is
where a is any complex number.^{[1]} The special choice a = 1 corresponds to the Newton fractal. The fixed points of this map are stable when a lies inside the disk of radius 1 centered at 1. When a is outside this disk, the fixed points are locally unstable, however the map still exhibits a fractal structure in the sense of Julia set. If p is a polynomial of degree d, then the sequence z_{n} is bounded provided that a is inside a disk of radius d centered at d.
More generally, Newton's fractal is a special case of a Julia set.
Serie : p(z) = z^{n}- 1
Other fractals where potential and trigonometric functions are multiplied. p(z) = z^{n}*Sin(z) - 1
The Nova fractal invented in the mid 1990s by Paul Derbyshire,^{[2]}^{[3]} is a generalization of the Newton fractal with the addition of a value c at each step:^{[4]}
The "Julia" variant of the Nova fractal keeps c constant over the image and initializes z_{0} to the pixel coordinates. The "Mandelbrot" variant of the Nova fractal initializes c to the pixel coordinates and sets z_{0} to a critical point, where^{[5]}
Commonly-used polynomials like p(z) = z^{3} − 1 or p(z) = (z − 1)^{3} lead to a critical point at z = 1.
In 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 in pseudocode as follows:
//z^3-1
float2 Function (float2 z)
{
return cpow(z, 3) - float2(1, 0); //cpow is an exponential function for complex numbers
}
//3*z^2
float2 Derivative (float2 z)
{
return 3 * 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.
float2 roots[3] = //Roots (solutions) of the polynomial
{
float2(1, 0),
float2(-.5, sqrt(3)/2),
float2(-.5, -sqrt(3)/2)
};
color colors[3] = //Assign a color for each root
{
red,
green,
blue
}
For each pixel (x, y) on the target, do:
{
zx = scaled x coordinate of pixel (scaled to lie in the Mandelbrot X scale (-2.5, 1))
zy = scaled y coordinate of pixel (scaled to lie in the Mandelbrot Y scale (-2, 1))
float2 z = float2(zx, zy); //z is originally set to the pixel coordinates
for (int iteration = 0;
iteration < maxIteration;
iteration++;)
{
z -= cdiv(Function(z), Derivative(z)); //cdiv is a function for dividing complex numbers
float tolerance = 0.000001;
for (int i = 0; i < roots.Length; i++)
{
float2 difference = 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)
{
return colors[i]; //Return the color corresponding to the root
}
}
}
return black; //If no solution is found
}