Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Feigenbaum constants
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==History== Feigenbaum originally related the first constant to the [[period-doubling bifurcation]]s in the [[logistic map]], but also showed it to hold for all [[one-dimensional]] [[map (mathematics)|maps]] with a single [[Quadratic function|quadratic]] [[Maxima and minima|maximum]]. As a consequence of this generality, every [[Chaos theory|chaotic system]] that corresponds to this description will bifurcate at the same rate. Feigenbaum made this discovery in 1975,<ref>{{cite journal |url=http://chaosbook.org/extras/mjf/LA-6816-PR.pdf |last=Feigenbaum |first=M. J. |year=1976 |title=Universality in complex discrete dynamics |journal=Los Alamos Theoretical Division Annual Report 1975β1976 }}</ref><ref>{{cite book |title=Chaos: An Introduction to Dynamical Systems |first1=K. T. |last1=Alligood |first2=T. D. |last2=Sauer |first3=J. A. |last3=Yorke |publisher=Springer |year=1996 |isbn=0-387-94677-2 }}</ref> and he officially published it in 1978.<ref>{{cite journal |last1=Feigenbaum |first1=Mitchell J. |title=Quantitative universality for a class of nonlinear transformations |journal=Journal of Statistical Physics |date=1978 |volume=19 |issue=1 |pages=25β52 |doi=10.1007/BF01020332 |bibcode=1978JSP....19...25F |s2cid=124498882 }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)