attractor

Uses your system voice; voice and rate in settings.

Q507187Snapshot

≈ 12 min read

Names in other languages

  • fiattraktori
  • Françaisattracteur
  • Italianoattrattore
  • DeutschAttraktor
  • Englishattractor
  • Češtinaatraktor
  • Españolatractor
  • glatractor

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

. Another visualization of the same 3D attractor is this video. Code capable of rendering this is available. In the mathematical field of dynamical systems, an attractor is a set of states toward which a system tends to evolve, for a wide variety of starting conditions of the system. System values that get close enough to the attractor values remain close even if slightly disturbed. In finite-dimensional systems, the evolving variable may be represented algebraically as an n-dimensional vector. The attractor is a region in n-dimensional space.

In physical systems, the n dimensions may be, for example, two or three positional coordinates for each of one or more physical entities; in economic systems, they may be separate variables such as the inflation rate and the unemployment rate. If the evolving variable is two- or three-dimensional, the attractor of the dynamic process can be represented geometrically in two or three dimensions, (as for example in the three-dimensional case depicted to the right).

An attractor can be a point, a finite set of points, a curve, a manifold, or even a complicated set with a fractal structure known as a strange attractor (see strange attractor below). If the variable is a scalar, the attractor is a subset of the real number line. Describing the attractors of chaotic dynamical systems has been one of the achievements of chaos theory.…

. Another visualization of the same 3D attractor is this video. Code capable of rendering this is available. In the mathematical field of dynamical systems, an attractor is a set of states toward which a system tends to evolve, for a wide variety of starting conditions of the system. System values that get close enough to the attractor values remain close even if slightly disturbed. In finite-dimensional systems, the evolving variable may be represented algebraically as an n-dimensional vector. The attractor is a region in n-dimensional space.

In physical systems, the n dimensions may be, for example, two or three positional coordinates for each of one or more physical entities; in economic systems, they may be separate variables such as the inflation rate and the unemployment rate. If the evolving variable is two- or three-dimensional, the attractor of the dynamic process can be represented geometrically in two or three dimensions, (as for example in the three-dimensional case depicted to the right).

An attractor can be a point, a finite set of points, a curve, a manifold, or even a complicated set with a fractal structure known as a strange attractor (see strange attractor below). If the variable is a scalar, the attractor is a subset of the real number line. Describing the attractors of chaotic dynamical systems has been one of the achievements of chaos theory. A trajectory of the dynamical system in the attractor does not have to satisfy any special constraints except for remaining on the attractor, forward in time.

The trajectory may be periodic or chaotic. If a set of points is periodic or chaotic, but the flow in the neighborhood is away from the set, the set is not an attractor, but instead is called a repeller (or repellor). Let t represent time and let f(t,\cdot) be a function which specifies the dynamics of the system. That is, if a is a point in an n -dimensional phase space, representing the initial state of the system, then f(0,a)=a and, for a positive value of t , f(t,a) is the result of the evolution of this state after t units of time.

For example, if the system describes the evolution of a free particle in one dimension then the phase space is the plane \R^2 with coordinates (x,v) , where x is the position of the particle, v is its velocity, a=(x,v) , and the evolution is given by , which iterates the function f(z) = z 2  + c.

The three darkest points are the points of the 3-cycle, which lead to each other in sequence, and iteration from any point in the basin of attraction leads to (usually asymptotic) convergence to this sequence of three points. f(t,(x,v))=(x+tv,v).\ An attractor is a subset A of the phase space characterized by the following three conditions: A is forward invariant under f : if a is an element of A then so is f(t,a) , for all t>0 .

There exists a neighborhood of A , called the basin of attraction for A and denoted B(A) , which consists of all points b that "enter" A in the limit t\to\infty . More formally, B(A) is the set of all points b in the phase space with the following property: For any open neighborhood N of A , there is a positive constant T such that f(t,b)\in N for all real t>T . There is no proper (non-empty) subset of A having the first two properties.

Since the basin of attraction contains an open set containing A , every point that is sufficiently close to A is attracted to A . The definition of an attractor uses a metric on the phase space, but the resulting notion usually depends only on the topology of the phase space. In the case of \R^n , the Euclidean norm is typically used. Many other definitions of attractor occur in the literature.

For example, some authors require that an attractor have positive measure (preventing a point from being an attractor), others relax the requirement that B(A) be a neighborhood.

Finite number of points

In a discrete-time system, an attractor can take the form of a finite number of points that are visited in sequence. Each of these points is called a periodic point.

This is illustrated by the logistic map, which depending on its specific parameter value can have an attractor consisting of 1 point, 2 points, 2 n points, 3 points, 3×2 n points, 4 points, 5 points, or any given positive integer number of points. for values ρ = 28, σ = 10, β = 8/3 An attractor is called strange if it has a fractal structure; that is, if it has non-integer Hausdorff dimension. This is often the case when the dynamics on it are chaotic, but strange nonchaotic attractors also exist.

If a strange attractor is chaotic, exhibiting sensitive dependence on initial conditions, then any two arbitrarily close alternative initial points on the attractor, after any of various numbers of iterations, will lead to points that are arbitrarily far apart (subject to the confines of the attractor), and after any of various other numbers of iterations will lead to points that are arbitrarily close together.

Thus a dynamic system with a chaotic attractor is locally unstable yet globally stable: once some sequences have entered the attractor, nearby points diverge from one another but never depart from the attractor. The term strange attractor was coined by David Ruelle and Floris Takens to describe the attractor resulting from a series of bifurcations of a system describing fluid flow. Strange attractors are often differentiable in a few directions, but some are like a Cantor dust, and therefore not differentiable.

Strange attractors may also be found in the presence of noise, where they may be shown to support invariant random probability measures of Sinai–Ruelle–Bowen type. Examples of strange attractors include the double-scroll attractor, Hénon attractor, Rössler attractor, and Lorenz attractor.

Attractors characterize the evolution of a system

. The attractor(s) for values of the parameter r from [2.4, 4] are shown on the vertical axis for 0 . The colour of a point indicates how often the point (r, x) is visited over the course of 10 6 iterations: frequently encountered values are coloured in blue, less frequently encountered values are yellow. A bifurcation occurs around r\approx3.0 , a second bifurcation (leading to four attractor values) is seen around r\approx3.5 . The dynamics become increasingly complicated for r>3.6 , interspersed with regions of simpler behaviour (white stripes).

The behavior of a dynamical system may be influenced by its parameters or the choice of initial conditions. The logistic map, defined as x_{n+1}=rx_n(1-x_n) , is a well-studied example of a system dependent on one parameter r . Its attractors for various values of r are shown in the figure. For small r the attractor is a single fixed point, which is shown on the bifurcation diagram as one line.

For other choices of r , more than one value of x may become attracting: at r \approx 3 the fixed point splits in two creating a period 2 cycle during a period-doubling bifurcation. As r increases, chaos emerges through a period-doubling cascade, meaning the attractor consists of an infinite number of points. At r\approx 3.83 a period 3 orbit can be found. It follows from the Sharkovskii's theorem that orbits of any natural period are present in the system.

Thus one dynamic equation can have vastly different attractors depending on the choice of parameters.

Basins of attraction

An attractor's basin of attraction is the region of the phase space, over which iterations are defined, such that any point (any initial condition) in that region will asymptotically be iterated into the attractor. For a stable linear system, every point in the phase space is in the basin of attraction. However, in nonlinear systems, some points may map directly or asymptotically to infinity, while other points may lie in a different basin of attraction and map asymptotically into a different attractor; other initial conditions may be in or map directly into a non-attracting point or cycle.

Linear equation or system

A univariate linear homogeneous difference equation x_t=ax_{t-1} diverges to infinity if |a|>1 from all initial points except 0; there is no attractor and therefore no basin of attraction. But if |a| all points on the number line map asymptotically (or directly in the case of 0) to 0; 0 is the attractor, and the entire number line is the basin of attraction.

Likewise, a linear matrix difference equation in a dynamic vector X , of the homogeneous form X_t=AX_{t-1} in terms of square matrix A will have all elements of the dynamic vector diverge to infinity if the largest eigenvalues of A is greater than 1 in absolute value; there is no attractor and no basin of attraction. But if the largest eigenvalue is less than 1 in magnitude, all initial vectors will asymptotically converge to the zero vector, which is the attractor; the entire n -dimensional space of potential initial vectors is the basin of attraction.

Similar features apply to linear differential equations. The scalar equation dx/dt =ax causes all initial values of x except zero to diverge to infinity if a>0 but to converge to an attractor at the value 0 if a , making the entire number line the basin of attraction for 0. And the matrix system dX/dt=AX gives divergence from all initial points except the vector of zeroes if any eigenvalue of the matrix A is positive; but if all the eigenvalues are negative the vector of zeroes is an attractor whose basin of attraction is the entire phase space.

Nonlinear equation or system

Equations or systems that are nonlinear can give rise to a richer variety of behavior than can linear systems. One example is Newton's method of iterating to a root of a nonlinear expression. If the expression has more than one real root, some starting points for the iterative algorithm will lead to one of the roots asymptotically, and other starting points will lead to another.

The basins of attraction for the expression's roots are generally not simple—it is not simply that the points nearest one root all map there, giving a basin of attraction consisting of nearby points. The basins of attraction can be infinite in number and arbitrarily small. For example, for the function f(x)=x^3-2x^2-11x+12 , the following initial conditions are in successive basins of attraction: showing basins of attraction in the complex plane for using Newton's method to solve x 5  − 1 = 0.

Points in like-colored regions map to the same root; darker means more iterations are needed to converge. 2.35287527 converges to 4; 2.35284172 converges to −3; 2.35283735 converges to 4; 2.352836327 converges to −3; 2.352836323 converges to 1. Newton's method can also be applied to complex functions to find their roots. Each root has a basin of attraction in the complex plane; these basins can be mapped as in the image shown. As can be seen, the combined basin of attraction for a particular root can have many disconnected regions.

For many complex functions, the boundaries of the basins of attraction are fractals.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375073514 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.