Estimating the Highest Time-Step in Numerical Methods to Enhance the Optimization of Chaotic Oscillators
Martín Alejandro Valencia-Ponce, Esteban Tlelo‐Cuautle, Luis Gerardo de la Fraga
Abstract
The execution time that takes to perform numerical simulation of a chaotic oscillator mainly depends on the time-step h. This paper shows that the optimization of chaotic oscillators can be enhanced by estimating the highest h in either one-step or multi-step methods. Four chaotic oscillators are used as a case study, and the optimization of their Kaplan-Yorke dimension (DKY) is performed by applying three metaheuristics, namely: particle swarm optimization (PSO), many optimizing liaison (MOL), and differential evolution (DE) algorithms. Three representative one-step and three multi-step methods are used to solve the four chaotic oscillators, for which the estimation of the highest h is obtained from their stability analysis. The optimization results show the effectiveness of using a high h value for the six numerical methods in reducing execution time while maximizing the positive Lyapunov exponent (LE+) and DKY of the chaotic oscillators by applying PSO, MOL, and DE algorithms.