Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Feigenbaum function

From Wikipedia, the free encyclopedia
Concept in dynamical systems

In the study ofdynamical systems the termFeigenbaum function has been used to describe two differentfunctions introduced by the physicistMitchell Feigenbaum:[1]

Idea

[edit]

Period-doubling route to chaos

[edit]

In the logistic map,

xn+1=rxn(1xn),{\displaystyle x_{n+1}=rx_{n}(1-x_{n}),}1

we have a functionfr(x)=rx(1x){\displaystyle f_{r}(x)=rx(1-x)}, and we want to study what happens when we iterate the map many times. The map might fall into afixed point, a fixed cycle, or chaos. When the map falls into a stable fixed cycle of lengthn{\displaystyle n}, we would find that the graph offrn{\displaystyle f_{r}^{n}} and the graph ofxx{\displaystyle x\mapsto x} intersects atn{\displaystyle n} points, and the slope of the graph offrn{\displaystyle f_{r}^{n}} is bounded in(1,+1){\displaystyle (-1,+1)} at those intersections.

For example, whenr=3.0{\displaystyle r=3.0}, we have a single intersection, with slope bounded in(1,+1){\displaystyle (-1,+1)}, indicating that it is a stable single fixed point.

Asr{\displaystyle r} increases to beyondr=3.0{\displaystyle r=3.0}, the intersection point splits to two, which is a period doubling. For example, whenr=3.4{\displaystyle r=3.4}, there are three intersection points, with the middle one unstable, and the two others stable.

Asr{\displaystyle r} approachesr=3.45{\displaystyle r=3.45}, another period-doubling occurs in the same way. The period-doublings occur more and more frequently, until at a certainr3.56994567{\displaystyle r\approx 3.56994567}, the period doublings become infinite, and the map becomes chaotic. This is theperiod-doubling route to chaos.

Relationship betweenxn+2{\displaystyle x_{n+2}} andxn{\displaystyle x_{n}} whena=2.7{\displaystyle a=2.7}. Before the period doubling bifurcation occurs. The orbit converges to the fixed pointxf2{\displaystyle x_{f2}}.
Relationship betweenxn+2{\displaystyle x_{n+2}} andxn{\displaystyle x_{n}} whena=3{\displaystyle a=3}. The tangent slope at the fixed pointxf2{\displaystyle x_{f2}}. is exactly 1, and a period doubling bifurcation occurs.
Relationship betweenxn+2{\displaystyle x_{n+2}} andxn{\displaystyle x_{n}} whena=3.3{\displaystyle a=3.3}. The fixed pointxf2{\displaystyle x_{f2}} becomes unstable, splitting into a periodic-2 stable cycle.
Whenr=3.0{\displaystyle r=3.0}, we have a single intersection, with slope exactly+1{\displaystyle +1}, indicating that it is about to undergo a period-doubling.
Whenr=3.4{\displaystyle r=3.4}, there are three intersection points, with the middle one unstable, and the two others stable.
Whenr=3.45{\displaystyle r=3.45}, there are three intersection points, with the middle one unstable, and the two others having slope exactly+1{\displaystyle +1}, indicating that it is about to undergo another period-doubling.
Whenr3.56994567{\displaystyle r\approx 3.56994567}, there are infinitely many intersections, and we have arrived atchaos via the period-doubling route.

Scaling limit

[edit]
Approach to the scaling limit asr{\displaystyle r} approachesr=3.5699{\displaystyle r^{*}=3.5699\cdots } from below.
At the point of chaosr=3.5699{\displaystyle r^{*}=3.5699\cdots }, as we repeat the period-doublingsfr1,fr2,fr4,fr8,fr16,{\displaystyle f_{r^{*}}^{1},f_{r^{*}}^{2},f_{r^{*}}^{4},f_{r^{*}}^{8},f_{r^{*}}^{16},\dots }, the graphs seem to resemble each other, except that they are shrunken towards the middle, and rotated by 180 degrees, converging to a fractal.

Looking at the images, one can notice that at the point of chaosr=3.5699{\displaystyle r^{*}=3.5699\cdots }, the curve offr{\displaystyle f_{r^{*}}^{\infty }} looks like a fractal. Furthermore, as we repeat the period-doublingsfr1,fr2,fr4,fr8,fr16,{\displaystyle f_{r^{*}}^{1},f_{r^{*}}^{2},f_{r^{*}}^{4},f_{r^{*}}^{8},f_{r^{*}}^{16},\dots }, the graphs seem to resemble each other, except that they are shrunken towards the middle, and rotated by 180 degrees.

This suggests to us a scaling limit: if we repeatedly double the function, then scale it up byα{\displaystyle \alpha } for a certain constantα{\displaystyle \alpha }:f(x)αf(f(x/α)){\displaystyle f(x)\mapsto -\alpha f(f(-x/\alpha ))} then at the limit, we would end up with a functiong{\displaystyle g} that satisfiesg(x)=αg(g(x/α)){\displaystyle g(x)=-\alpha g(g(-x/\alpha ))}. Further, as the period-doubling intervals become shorter and shorter, theratio between two period-doubling intervals converges to a limit, the first Feigenbaum constantδ=4.6692016{\displaystyle \delta =4.6692016\cdots }.

For the wrong values of scaling factorα{\displaystyle \alpha }, the map does not converge to a limit, but whenα=2.5029{\displaystyle \alpha =2.5029\dots }, it converges.
At the point of chaosr=3.5699{\displaystyle r^{*}=3.5699\cdots }, as we repeat the functional equation iterationf(x)αf(f(x/α)){\displaystyle f(x)\mapsto -\alpha f(f(-x/\alpha ))} withα=2.5029{\displaystyle \alpha =2.5029\dots }, we find that the map does converge to a limit.

The constantα{\displaystyle \alpha } can be numerically found by trying many possible values. For the wrong values, the map does not converge to a limit, but when it isα=2.5029{\displaystyle \alpha =2.5029\dots }, it converges. This is the second Feigenbaum constant.

Chaotic regime

[edit]

In the chaotic regime,fr{\displaystyle f_{r}^{\infty }}, the limit of the iterates of the map, becomes chaotic dark bands interspersed with non-chaotic bright bands.

In the chaotic regime,fr{\displaystyle f_{r}^{\infty }}, the limit of the iterates of the map, becomes chaotic dark bands interspersed with non-chaotic bright bands.

Other scaling limits

[edit]

Whenr{\displaystyle r} approachesr3.8494344{\displaystyle r\approx 3.8494344}, we have another period-doubling approach to chaos, but this time with periods 3, 6, 12, ... This again has the same Feigenbaum constantsδ,α{\displaystyle \delta ,\alpha }. The limit off(x)αf(f(x/α)){\textstyle f(x)\mapsto -\alpha f(f(-x/\alpha ))} is also the same function. This is an example ofuniversality.

Logistic map approaching the period-doubling chaos scaling limitr=3.84943{\displaystyle r^{*}=3.84943\dots } from below. At the limit, this has the same shape as that ofr=3.5699{\displaystyle r^{*}=3.5699\cdots }, since all period-doubling routes to chaos are the same (universality).

We can also consider period-tripling route to chaos by picking a sequence ofr1,r2,{\displaystyle r_{1},r_{2},\dots } such thatrn{\displaystyle r_{n}} is the lowest value in the period-3n{\displaystyle 3^{n}} window of the bifurcation diagram. For example, we haver1=3.8284,r2=3.85361,{\displaystyle r_{1}=3.8284,r_{2}=3.85361,\dots }, with the limitr=3.854077963{\displaystyle r_{\infty }=3.854077963\dots }. This has a different pair of Feigenbaum constantsδ=55.26,α=9.277{\displaystyle \delta =55.26\dots ,\alpha =9.277\dots }.[2] Andfr{\displaystyle f_{r}^{\infty }}converges to the fixed point tof(x)αf(f(f(x/α))){\displaystyle f(x)\mapsto -\alpha f(f(f(-x/\alpha )))}As another example, period-4-pling has a pair of Feigenbaum constants distinct from that of period-doubling, even though period-4-pling is reached by two period-doublings. In detail, definer1,r2,{\displaystyle r_{1},r_{2},\dots } such thatrn{\displaystyle r_{n}} is the lowest value in the period-4n{\displaystyle 4^{n}} window of the bifurcation diagram. Then we haver1=3.960102,r2=3.9615554,{\displaystyle r_{1}=3.960102,r_{2}=3.9615554,\dots }, with the limitr=3.96155658717{\displaystyle r_{\infty }=3.96155658717\dots }. This has a different pair of Feigenbaum constantsδ=981.6,α=38.82{\displaystyle \delta =981.6\dots ,\alpha =38.82\dots }.

In general, each period-multiplying route to chaos has its own pair of Feigenbaum constants. In fact, there are typically more than one. For example, for period-7-pling, there are at least 9 different pairs of Feigenbaum constants.[2]

Generally,3δ2α2{\textstyle 3\delta \approx 2\alpha ^{2}}, and the relation becomes exact as both numbers increase to infinity:limδ/α2=2/3{\displaystyle \lim \delta /\alpha ^{2}=2/3}.

Feigenbaum-Cvitanović functional equation

[edit]

This functional equation arises in the study of one-dimensional maps that, as a function of a parameter, go through a period-doubling cascade. Discovered byMitchell Feigenbaum andPredrag Cvitanović,[3] the equation is the mathematical expression of theuniversality of period doubling. It specifies a functiong and a parameterα by the relation

g(x)=αg(g(x/α)){\displaystyle g(x)=-\alpha g(g(-x/\alpha ))}

with the initial conditions{g(0)=1,g(0)=0,g(0)<0.{\displaystyle {\begin{cases}g(0)=1,\\g'(0)=0,\\g''(0)<0.\end{cases}}}For a particular form of solution with a quadratic dependence of the solutionnearx = 0,α = 2.5029... is one of theFeigenbaum constants.

The power series ofg{\displaystyle g} is approximately[4]g(x)=11.52763x2+0.104815x4+0.026705x6+O(x8){\displaystyle g(x)=1-1.52763x^{2}+0.104815x^{4}+0.026705x^{6}+O(x^{8})}

Renormalization

[edit]

The Feigenbaum function can be derived by arenormalization argument.[5]

The Feigenbaum function satisfies[6]g(x)=limn1F(2n)(0)F(2n)(xF(2n)(0)){\displaystyle g(x)=\lim _{n\to \infty }{\frac {1}{F^{\left(2^{n}\right)}(0)}}F^{\left(2^{n}\right)}\left(xF^{\left(2^{n}\right)}(0)\right)} for any map on thereal lineF{\displaystyle F} at the onset of chaos.

Scaling function

[edit]

The Feigenbaum scaling function provides a complete description of theattractor of thelogistic map at the end of the period-doubling cascade. The attractor is aCantor set, and just as the middle-third Cantor set, it can be covered by a finite set of segments, all bigger than a minimal sizedn. For a fixeddn the set of segments forms a coverΔn of the attractor. The ratio of segments from two consecutive covers,Δn andΔn+1 can be arranged to approximate a functionσ, the Feigenbaum scaling function.

See also

[edit]

Notes

[edit]
  1. ^Feigenbaum, M. J. (1976) "Universality in complex discrete dynamics", Los Alamos Theoretical Division Annual Report 1975-1976
  2. ^abDelbourgo, R.; Hart, W.; Kenny, B. G. (1985-01-01)."Dependence of universal constants upon multiplication period in nonlinear maps".Physical Review A.31 (1):514–516.Bibcode:1985PhRvA..31..514D.doi:10.1103/PhysRevA.31.514.ISSN 0556-2791.
  3. ^Footnote on p. 46 of Feigenbaum (1978) states "This exact equation was discovered by P. Cvitanović during discussion and in collaboration with the author."
  4. ^Iii, Oscar E. Lanford (May 1982)."A computer-assisted proof of the Feigenbaum conjectures".Bulletin (New Series) of the American Mathematical Society.6 (3):427–434.doi:10.1090/S0273-0979-1982-15008-X.ISSN 0273-0979.
  5. ^Feldman, David P. (2019).Chaos and dynamical systems. Princeton.ISBN 978-0-691-18939-0.OCLC 1103440222.{{cite book}}: CS1 maint: location missing publisher (link)
  6. ^Weisstein, Eric W."Feigenbaum Function".mathworld.wolfram.com. Retrieved2023-05-07.

Bibliography

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Feigenbaum_function&oldid=1296421637"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp