The DOI matches its Crossref record.
Chaotic characteristics of a one-dimensional iterative map with infinite collapses
Abstract
A one-dimensional iterative chaotic map with infinite collapses within symmetrical region [-1, O)/spl cup/(O, +1] is proposed. The stability of fixed points and that around the singular point are analyzed. Higher Lyapunov exponents of proposed map show stronger chaotic characteristics than some iterative and continuous chaotic models usually used. There exist inverse bifurcation phenomena and special main periodic windows at certain positions shown in the bifurcation diagram, which can explain the generation mechanism of chaos. The chaotic model with good properties can be generated if choosing the parameter of the map properly. Stronger inner pseudorandom characteristics can also be observed through /spl chi//sup 2/ test on the supposition of even distribution. This chaotic model may have many advantages in practical use.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Chaotic whale optimization algorithm
Kaur, G., & Arora, S. (2018) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2017.12.006 · Cited by 533
Gandomi, A. H., & Yang, X.-S. (2014) · Journal of Computational Science · doi:10.1016/j.jocs.2013.10.002 · Cited by 508
Chaotic grey wolf optimization algorithm for constrained optimization problems
Kohli, M., & Arora, S. (2018) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2017.02.005 · Cited by 431
A novel bit-level image encryption algorithm based on 2D-LICM hyperchaotic map
Cao, C., Sun, K., & Liu, W. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.08.020 · Cited by 385
Tavazoei, M. S., & Haeri, M. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.09.087 · Cited by 283
Metadata
- Authors
- He, D., He, C., Jiang, L.-G., Zhu, H.-W., & Hu, G.-R.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2001-07
- Volume
- 48
- Issue
- 7
- Pages
- 900-906
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2156908589
- Cited by
- 210
- References
- 0
- FWCI
- 2.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Chaotic characteristics of a one-dimensional iterative map with infinite collapses. https://app.cochat.ai/papers/10.1109/81.933333
- The paper
- He, D., He, C., Jiang, L.-G., Zhu, H.-W., & Hu, G.-R. (2001). Chaotic characteristics of a one-dimensional iterative map with infinite collapses. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. https://doi.org/10.1109/81.933333
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.