Abstract

In this chapter, we prove analytically and numerically aided by computer simulations, that the Parrondo game can be implemented numerically to control and anticontrol chaos of a large class of nonlinear continuous-time and discrete-time systems. The game states that alternating loosing gains of two games, one can actually obtain a winning game, i.e.: “losing \(+\) losing \(=\) winning” or, in other words: “two ugly parents can have beautiful children” (Zeilberger, on receiving the 1998 Leroy P. Steele Prize). For this purpose, the Parameter Switching (PS) algorithm is implemented. The PS algorithm switches the control parameter of the underlying system, within a set of values as the system evolves. The obtained attractor matches the attractor obtained by replacing the parameter with the average of switched values. The systems to which the PS algorithm based Parrondo’s game applies are continuous-time of integer or fractional order ones such as: Lorenz system, Chen system, Chua system, Rossler system, to name just a few, and also discrete-time systems and fractals. Compared with some other works on switch systems, the PS algorithm utilized in this chapter is a convergent algorithm which allows to approximate any desired dynamic to arbitrary accuracy.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.