Number of Forts in Iterated Logistic Mapping
Using the theory of complete discrimination system and the computer algebra system MAPLE V.17, we compute the number of forts for the logistic mapping fλ(x)=λx(1-x) on [0,1] parameterized by λ∈(0,4]. We prove that if 0<λ≤2 then the number of forts does not increase under iteration and that if λ&g...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2016/4682168 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|