Number of Forts in Iterated Logistic Mapping

Kaixuan Yu and Zhiheng Yu

Discrete Dynamics in Nature and Society, 2016, vol. 2016, issue 1

Abstract: 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 is not bounded under iteration. Furthermore, we focus on the case of λ > 2 and give for each k = 1, …, 7 some critical values of λ for the change of numbers of forts.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2016/4682168

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnddns:v:2016:y:2016:i:1:n:4682168

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().