Sensitive dependence in control systems and reachable sets (Q4366140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1089444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sensitive dependence in control systems and reachable sets |
scientific article; zbMATH DE number 1089444 |
Statements
Sensitive dependence in control systems and reachable sets (English)
0 references
1 June 1998
0 references
chaos
0 references
Lyapunov exponent
0 references
logistic map
0 references
reachability
0 references
0 references
0 references
0.717373788356781
0 references
0.7146098613739014
0 references
0.7110033631324768
0 references
0.708778440952301
0 references
The logistic map \(f_p(x)= px(1- x)\), \(x\in[0,1]\), \(p\in[0, 4]\) is studied mainly numerically from the point of view of reachability of \(x^*\) in \(n\) steps by constant \(p\) from initial \(x_0\). From the conclusion: ``The 1980s view of chaos was that it was troublesome, difficult and to be avoided if possible. \([\dots]\) this view may, in certain circumstances, be exactly opposite to the truth: certain chaotic systems can, in fact, be seen as among the friendliest observed in nature, since their future evolution may be so readily influenced by small adjustments''.
0 references
