Autori: Marius-F. Danca, Cristina Morel

Editorial: Dynamics of Continuous, Discrete & Impulsive Siystems, B, 18 , p.601-614, 2011.

Rezumat:

In this paper, we prove numerically and computationally that the attractors
synthesis algorithm introduced in [1] for a class of dynamical systems can be applied for a class of networks too. While the underlying initial value problem is numerically integrated, if the control parameter is switched within a considered set of values, the obtained attractor will belong to the class of all attractors of the considered network.
Moreover, this synthesized attractor coincides with the attractor obtained with the control parameter replaced with the averaged switched values. The algorithm is applied here to a
class of networks with the minimal dimension four, for which chaos still exists. In order to verify the accuracy of the results, the algorithm was run for random choice with di¤erent
distributions of the parameter values and their weights.

Cuvinte cheie: global attractors, local attractors, numerical methods for ODEs, synthesized