Entropy increase in switching systems

  • The relation between the complexity of a time-switched dynamics and the complexity of its control sequence depends critically on the concept of a non-autonomous pullback attractor. For instance, the switched dynamics associated with scalar dissipative affine maps has a pullback attractor consisting of singleton component sets. This entails that the complexity of the control sequence and switched dynamics, as quantified by the topological entropy, coincide. In this paper we extend the previous framework to pullback attractors with nontrivial components sets in order to gain further insights in that relation. This calls, in particular, for distinguishing two distinct contributions to the complexity of the switched dynamics. One proceeds from trajectory segments connecting different component sets of the attractor; the other contribution proceeds from trajectory segments within the component sets. We call them “macroscopic” and “microscopic” complexity, respectively, because only the first one can be measured by our analytical tools. As a result of this picture, we obtain sufficient conditions for a switching system to be more complex than its unswitched subsystems, i.e., a complexity analogue of Parrondo’s paradox.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:José M. Amigó, Peter E. Kloeden, Ángel Giménez
URN:urn:nbn:de:hebis:30:3-314404
DOI:https://doi.org/10.3390/e15062363
ISSN:1099-4300
Parent Title (English):Entropy: an international and interdisciplinary journal of entropy and information studies
Publisher:MDPI
Place of publication:Basel
Document Type:Article
Language:English
Date of Publication (online):2013/06/07
Date of first Publication:2013/06/07
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2013/08/19
Tag:complexity; non-autonomous dynamical systems; set-valued pullback attractors; switching systems; topological entropy
Volume:15
Page Number:21
First Page:2363
Last Page:2383
Note:
© 2013 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).
HeBIS-PPN:352700718
Institutes:Informatik und Mathematik / Mathematik
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Sammlungen:Universitätspublikationen
Licence (German):License LogoCreative Commons - Namensnennung 3.0