Number of Forts in Iterated Logistic Mapping
Joint Authors
Source
Discrete Dynamics in Nature and Society
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-09-07
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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 λ > 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.
American Psychological Association (APA)
Yu, Kaixuan& Yu, Zhiheng. 2016. Number of Forts in Iterated Logistic Mapping. Discrete Dynamics in Nature and Society،Vol. 2016, no. 2016, pp.1-6.
https://search.emarefa.net/detail/BIM-1103455
Modern Language Association (MLA)
Yu, Kaixuan& Yu, Zhiheng. Number of Forts in Iterated Logistic Mapping. Discrete Dynamics in Nature and Society No. 2016 (2016), pp.1-6.
https://search.emarefa.net/detail/BIM-1103455
American Medical Association (AMA)
Yu, Kaixuan& Yu, Zhiheng. Number of Forts in Iterated Logistic Mapping. Discrete Dynamics in Nature and Society. 2016. Vol. 2016, no. 2016, pp.1-6.
https://search.emarefa.net/detail/BIM-1103455
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1103455