Approximating hidden chaotic attractors via parameter switching
Abstract: In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The Parameter Switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.