Geometric Mean-Based Approximation Method for Discrete Chaotification in Chaotic Map

Dynamical systems are complex and constantly changing systems that exhibit predictable and unpredictable behaviour because of their inherent randomness and sensitivity to initial conditions. In the last few years, the dynamics of various fixed-point recursive methods and chaotic maps have received significant attention from the research community. Generally, in dynamical systems, the standard dynamics revolve around the chaotic map λp(1-p), where the growth rate parameter λ ∈ [0, 4]. In this article, a novel Geometric Mean-Based fixed point recursive method is used to examine the dynamical behaviour in the chaotic map λp(1−p) in which the growth rate parameter λ ∈ [0, 4]. approaches a maximum value of 6.7. Furthermore, the mathematical and computational study reveals the efficiency of the proposed approximation method. In this method, the logistic map admits extra freedom in the parameter λ, which gives improved dynamic properties such as fixed point, periodicity, chaos, and Lyapunov exponent. Additionally, it has been noted that better dynamic performance could enhance various applications such as weather forecasting, secure communications, neural networks, cryptography, and discrete traffic flow models, etc.

Authors

Publication Details

Journal
Applied Mathematics and Statistics
Published
2025-06-30
DOI
https://doi.org/10.53941/ams.2025.100004
Primary Topic
Chaos control and synchronization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Geometric Mean-Based Approximation Method for Discrete Chaotification in Chaotic Map

Ashish Kumar
Applied Mathematics and Statistics
Chaos control and synchronization
article

Geometric Mean-Based Approximation Method for Discrete Chaotification in Chaotic Map

Ashish Kumar
article en

Abstract

Dynamical systems are complex and constantly changing systems that exhibit predictable and unpredictable behaviour because of their inherent randomness and sensitivity to initial conditions. In the last few years, the dynamics of various fixed-point recursive methods and chaotic maps have received significant attention from the research community. Generally, in dynamical systems, the standard dynamics revolve around the chaotic map λp(1-p), where the growth rate parameter λ ∈ [0, 4]. In this article, a novel Geometric Mean-Based fixed point recursive method is used to examine the dynamical behaviour in the chaotic map λp(1−p) in which the growth rate parameter λ ∈ [0, 4]. approaches a maximum value of 6.7. Furthermore, the mathematical and computational study reveals the efficiency of the proposed approximation method. In this method, the logistic map admits extra freedom in the parameter λ, which gives improved dynamic properties such as fixed point, periodicity, chaos, and Lyapunov exponent. Additionally, it has been noted that better dynamic performance could enhance various applications such as weather forecasting, secure communications, neural networks, cryptography, and discrete traffic flow models, etc.

Applied Mathematics and Statistics
Openalex Percentile: Top 88%
Chaos control and synchronization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.