Metraipolis › archive › dc_a4cdc9fb0cf6

Newton fractal — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Newton_fractal
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:23:20.414Z
SHA-256 of the archived text
4c32262b963447e3962415ce624057da6572f99e530c29a2a32a58310f3905bf
Stable URL of this page
https://metraipolis.com/documento/dc_a4cdc9fb0cf6

How to cite

Newton fractal — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Newton_fractal (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a4cdc9fb0cf6 (Metraipolis archive dc_a4cdc9fb0cf6, sha256 4c32262b963447e3962415ce624057da6572f99e530c29a2a32a58310f3905bf)
BibTeX
@misc{dca4cdc9fb0cf6,
  title = {Newton fractal — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Newton_fractal},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a4cdc9fb0cf6; sha256 4c32262b963447e3962415ce624057da6572f99e530c29a2a32a58310f3905bf},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Newton_fractal. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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) ∈ C {\displaystyle \mathbb {C} } [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 Gk, 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 z0 for Newton's iteration zn + 1 := zn − p(zn)/p'(zn), yielding a sequence of points z1, z2, …, If the sequence converges to the root ζk, then z0 was an element of the region Gk. 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 z3 − 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 (p1, …, pd) of the polynomial p ( z ) = z d + p 1 z d − 1 + ⋯ + p d − 1 z + p d := ( z − ζ 1 ) ( z − ζ 2 ) ⋯ ( z − ζ d ) {\displaystyle p(z)=z^{d}+p_{1}z^{d-1}+\cdots +p_{d-1}z+p_{d}:=(z-\zeta _{1})(z-\zeta _{2})\cdots (z-\zeta _{d})} . Then for a rectangular lattice z m n = z 00 + m Δ x + i n Δ y ; m = 0 , … , M − 1 ; n = 0 , … , N − 1 {\displaystyle z_{mn}=z_{00}+m\,\Delta x+in\,\Delta y;\quad m=0,\ldots ,M-1;\quad n=0,\ldots ,N-1} of points in C {\displaystyle \mathbb {C} } , 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 fk(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 |zD − ζk(m,n)| < ε for some 

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Newton fractal» — https://en.wikipedia.org/wiki/Newton_fractal
Wikidata Q1151001 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1151001
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Newton_fractal?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376801113, consultata il 2026-10-07T16:54:32.463Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 26795cf9a2052b89486bf4d56f46dfc0a2d4092967f4c13df0242000e85be379