An official website of the United States government
Active nematics are an important new paradigm in soft condensed matter systems. They consist of rodlike components with an internal driving force pushing them out of equilibrium. The resulting fluid motion exhibits chaotic advection, in which a small patch of fluid is stretched exponentially in length. Using simulation, this paper shows that this system can exhibit stable periodic motion when confined to a sufficiently small square with periodic boundary conditions. Moreover, employing tools from braid theory, we show that this motion is maximally mixing, in that it optimizes the (dimensionless) “topological entropy”—the exponential stretching rate of a material line advected by the fluid. That is, this periodic motion of the defects, counterintuitively, produces more chaotic mixing than chaotic motion of the defects. We also explore the stability of the periodic state. Importantly, we show how to stabilize this orbit into a larger periodic tiling, a critical necessity for it to be seen in future experiments.
more »
« less
Global Exponential Stability or Contraction of an Unforced System do not Imply Entrainment to Periodic Inputs
It is often of interest to know which systems will approach a periodic trajectory when given a periodic input. Results are available for certain classes of systems, such as contracting systems, showing that they always entrain to periodic inputs. In contrast to this, we demonstrate that there exist systems which are globally exponentially stable yet do not entrain to a periodic input. This could be seen as surprising, as it is known that globally exponentially stable systems are in fact contracting with respect to some Riemannian metric. The paper also addresses the broader issue of entrainment when an input is added to a contractive system.
more »
« less
- Award ID(s):
- 2052455
- PAR ID:
- 10629144
- Publisher / Repository:
- IEEE
- Date Published:
- ISBN:
- 979-8-3503-8265-5
- Page Range / eLocation ID:
- 1837 to 1842
- Format(s):
- Medium: X
- Location:
- Toronto, ON, Canada
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Periodic event‐triggered control (PETC) evaluates triggering conditions only at periodic sampling times, based on which it is decided whether the controller needs to be updated. This article investigates the global stabilization of nonlinear systems that are affected by external disturbances under PETC mechanisms. Sufficient conditions are provided to ensure the resulting closed‐loop system is input‐to‐state stable (ISS) for the state feedback and the observer‐based output feedback configurations separately. The sampling period and the triggering functions are chosen such that the ISS‐Lyapunov function of continuous dynamics is also the ISS‐Lyapunov function of the overall system. Based on that, sufficient conditions in the form of linear matrix inequalities are provided for the PETC design of incrementally quadratic nonlinear systems. Two simulation examples are provided to illustrate the effectiveness of the proposed method.more » « less
-
As dialogue systems become more prevalent in the form of personalized assistants, there is an increasingly important role for systems which can socially engage the user by influencing social factors like rapport. For example, learning companions enhance learning through socio-motivational support and are more successful when users feel rapport. In this work, I explore social engagement in dialogue systems in terms of acoustic-prosodic entrainment; entrainment is a phenomenon where over the course of a conversation, speakers adapt their acoustic-prosodic features, becoming more similar in their pitch, intensity, or speaking rate. Correlated with rapport and task success, entrainment plays a significant role in how individuals connect; a system which can entrain has potential to improve social engagement by enhancing these factors. As a result of this work, I introduce a dialogue system which can entrain and investigate its effects on social factors like rapport.more » « less
-
Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the natural metric in their domain, making the applicability of Banach's theorem limited. We explore how generally we can apply Banach's fixed point theorem to establish the convergence of iterative methods when pairing it with carefully designed metrics. Our first result is a strong converse of Banach's theorem, showing that it is a universal analysis tool for establishing global convergence of iterative methods to unique fixed points, and for bounding their convergence rate. In other words, we show that, whenever an iterative map globally converges to a unique fixed point, there exists a metric under which the iterative map is contracting and which can be used to bound the number of iterations until convergence. We illustrate our approach in the widely used power method, providing a new way of bounding its convergence rate through contraction arguments. We next consider the computational complexity of Banach's fixed point theorem. Making the proof of our converse theorem constructive, we show that computing a fixed point whose existence is guaranteed by Banach's fixed point theorem is CLS-complete. We thus provide the first natural complete problem for the class CLS, which was defined in [Daskalakis, Papadimitriou 2011] to capture the complexity of problems such as P-matrix LCP, computing KKT-points, and finding mixed Nash equilibria in congestion and network coordination games.more » « less
-
Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the natural metric in their domain, making the applicability of Banach's theorem limited. We explore how generally we can apply Banach's fixed point theorem to establish the convergence of iterative methods when pairing it with carefully designed metrics. Our first result is a strong converse of Banach's theorem, showing that it is a universal analysis tool for establishing global convergence of iterative methods to unique fixed points, and for bounding their convergence rate. In other words, we show that, whenever an iterative map globally converges to a unique fixed point, there exists a metric under which the iterative map is contracting and which can be used to bound the number of iterations until convergence. We illustrate our approach in the widely used power method, providing a new way of bounding its convergence rate through contraction arguments. We next consider the computational complexity of Banach's fixed point theorem. Making the proof of our converse theorem constructive, we show that computing a fixed point whose existence is guaranteed by Banach's fixed point theorem is CLS-complete. We thus provide the first natural complete problem for the class CLS, which was defined in [DP11] to capture the complexity of problems such as P-matrix LCP, computing KKT-points, and finding mixed Nash equilibria in congestion and network coordination games.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.23919/ACC60939.2024.10644655
