We present the generalized forms of Parrondo＇s paradox existing in fractional-order nonlinear systems. The gener- alization is implemented by applying a parameter switching （PS） algorithm to the corresponding initi...We present the generalized forms of Parrondo＇s paradox existing in fractional-order nonlinear systems. The gener- alization is implemented by applying a parameter switching （PS） algorithm to the corresponding initial value problems associated with the fractional-order nonlinear systems. The PS algorithm switches a system parameter within a specific set of N 〉 2 values when solving the system with some numerical integration method. It is proven that any attractor of the concerned system can be approximated numerically. By replacing the words ＂winning＂ and ＂loosing＂ in the classical Parrondo＇s paradox with ＂order＂ and ＂chaos＂, respectively, the PS algorithm leads to the generalized Parrondo＇s paradox： chaos1 ＋ chaos2 ＋..- ＋ chaosN = order and order1 ＋ order2 ＋.-. ＋ orderN = chaos. Finally, the concept is well demon- strated with the results based on the fractional-order Chen system.展开更多
文摘We present the generalized forms of Parrondo＇s paradox existing in fractional-order nonlinear systems. The gener- alization is implemented by applying a parameter switching （PS） algorithm to the corresponding initial value problems associated with the fractional-order nonlinear systems. The PS algorithm switches a system parameter within a specific set of N 〉 2 values when solving the system with some numerical integration method. It is proven that any attractor of the concerned system can be approximated numerically. By replacing the words ＂winning＂ and ＂loosing＂ in the classical Parrondo＇s paradox with ＂order＂ and ＂chaos＂, respectively, the PS algorithm leads to the generalized Parrondo＇s paradox： chaos1 ＋ chaos2 ＋..- ＋ chaosN = order and order1 ＋ order2 ＋.-. ＋ orderN = chaos. Finally, the concept is well demon- strated with the results based on the fractional-order Chen system.
