.png){kind=icon}
.png){kind=icon}
Return
Parameter identification for discrete memristive chaotic map using adaptive differential evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s11071-021-06993-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Since the concept of discrete memristor was proposed, more and more scholars began to study this topic. At present, most of works on the discrete memristor are devoted to the mathematical modeling and digital circuit implementation, but the research on its synchronization control has not received much attention. This paper focuses on the parameter identification for the discrete memristive chaotic map, and a modified intelligent optimization algorithm named adaptive differential evolution algorithm is proposed. To deal with the complex behaviors of hyperchaos and coexisting attractors of the considered discrete memristive chaotic maps, the identification objective function adopts two special parts: time sequences and return maps. Numerical simulations demonstrate that the proposed algorithm has the best performance among six existing algorithms, and it can still accurately identify the parameters of the original system under noise interference.
Keywords:
Parameter identification
Discrete memristor
Chaotic map
Differential evolution algorithm
Return maps
Coexisting attractors
Journal
IF:
6
Papers:
1.4W
Citations:
4.1W