Infinite line of equilibriums in a novel fractional map with coexisting infinitely many attractors and initial offset boosting

被引:10
|
作者
Almatroud, A. Othman [2 ]
Khennaoui, Amina-Aicha [3 ]
Ouannas, Adel [4 ]
Viet-Thanh Pham [1 ]
机构
[1] Ton Duc Thang Univ, Fac Elect & Elect Engn, Nonlinear Syst & Applicat, Ho Chi Minh City, Vietnam
[2] Univ Hail, Fac Sci, Dept Math, Hail 81451, Saudi Arabia
[3] Univ Larbi Ben Mhidi, Lab Dynam Syst & Control, Oum El Bouaghi, Algeria
[4] Univ Larbi Ben Mhidi, Dept Math & Comp Sci, Oum El Bouaghi, Algeria
关键词
chaos; complexity; fractional map; initial-boosting attractors; CHAOS;
D O I
10.1515/ijnsns-2020-0180
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The study of the chaotic dynamics in fractional-order discrete-time systems has received great attention in the past years. In this paper, we propose a new 2D fractional map with the simplest algebraic structure reported to date and with an infinite line of equilibrium. The conceived map possesses an interesting property not explored in literature so far, i.e., it is characterized, for various fractional-order values, by the coexistence of various kinds of periodic, chaotic and hyper-chaotic attractors. Bifurcation diagrams, computation of the maximum Lyapunov exponents, phase plots and 0-1 test are reported, with the aim to analyse the dynamics of the 2D fractional map as well as to highlight the coexistence of initial-boosting chaotic and hyperchaotic attractors in commensurate and incommensurate order. Results show that the 2D fractional map has an infinite number of coexistence symmetrical chaotic and hyper-chaotic attractors. Finally, the complexity of the fractional-order map is investigated in detail via approximate entropy.
引用
收藏
页码:373 / 391
页数:19
相关论文
共 12 条
  • [1] Infinitely Many Coexisting Attractors and Scrolls in a Fractional-Order Discrete Neuron Map
    Ren, Lujie
    Qin, Lei
    Jahanshahi, Hadi
    Mou, Jun
    [J]. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2023, 33 (16):
  • [2] A novel class of two-dimensional chaotic maps with infinitely many coexisting attractors
    Zhang, Li-Ping
    Liu, Yang
    Wei, Zhou-Chao
    Jiang, Hai-Bo
    Bi, Qin-Sheng
    [J]. CHINESE PHYSICS B, 2020, 29 (06)
  • [3] A novel class of two-dimensional chaotic maps with infinitely many coexisting attractors
    张丽萍
    刘洋
    魏周超
    姜海波
    毕勤胜
    [J]. Chinese Physics B, 2020, 29 (06) : 137 - 142
  • [4] Initial offset boosting coexisting attractors in memristive multi-double-scroll Hopfield neural network
    Zhang, Sen
    Zheng, Jiahao
    Wang, Xiaoping
    Zeng, Zhigang
    He, Shaobo
    [J]. NONLINEAR DYNAMICS, 2020, 102 (04) : 2821 - 2841
  • [5] Initial offset boosting coexisting attractors in memristive multi-double-scroll Hopfield neural network
    Sen Zhang
    Jiahao Zheng
    Xiaoping Wang
    Zhigang Zeng
    Shaobo He
    [J]. Nonlinear Dynamics, 2020, 102 : 2821 - 2841
  • [6] Hidden Extreme Multistability and Initial Offset-boosting of Fractional Order Hyperchaotic Map
    Khennaoui, Amina-Aicha
    Ouannas, Adel
    Cafagna, Donato
    [J]. 2021 21ST IEEE INTERNATIONAL CONFERENCE ON ENVIRONMENT AND ELECTRICAL ENGINEERING AND 2021 5TH IEEE INDUSTRIAL AND COMMERCIAL POWER SYSTEMS EUROPE (EEEIC/I&CPS EUROPE), 2021,
  • [7] Characteristic analysis of a simple fractional-order chaotic system with infinitely many coexisting attractors and Its DSP implementation
    Ye, Xiaolin
    Wang, Xingyuan
    [J]. PHYSICA SCRIPTA, 2020, 95 (07)
  • [8] Reversals of period doubling, coexisting multiple attractors, and offset boosting in a novel memristive diode bridge-based hyperjerk circuit
    Jacques Kengne
    Gervais Dolvis Leutcho
    Adélaïde Nicole Kengnou Telem
    [J]. Analog Integrated Circuits and Signal Processing, 2019, 101 : 379 - 399
  • [10] Reversals of period doubling, coexisting multiple attractors, and offset boosting in a novel memristive diode bridge-based hyperjerk circuit
    Kengne, Jacques
    Leutcho, Gervais Dolvis
    Telem, Adelaide Nicole Kengnou
    [J]. ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING, 2019, 101 (03) : 379 - 399