Dissipative Dynamical Systems

This paper presents a robust control synthesis method for linear time-invariant (LTI) differential systems with parametric uncertainty. The uncertain dynamics is described by a parametric kernel representation. We use parametric quadratic differential forms (QDF) to represent the dissipativity properties (both storage function and supply rate) of the uncertain system. The control design utilizes sum-of-squares (SOS) programming to search for a QDF supply rate for the controller such that the supply rate of the closed-loop system satisfies robust stability and performance conditions. Such a supply rate is then applied for control synthesis based J-factorization.

In this work we study the Positive Extension property and Hilbert's 17th problem for real analytic germs and sets. A real analytic germ X0 of has the property if every positive semidefinite analytic function germ on X0 has a positive semidefinite analytic extension to ; analogously one states the property for a global real analytic set X in an open set Ω of ℝn. These properties are natural variations of Hilbert's 17th problem. Here, we prove that: (1) A real analytic germ has the property if and only if every positive semidefinite analytic function germ on X0 is a sum of squares of analytic function germs on X0; and (2) a global real analytic set X of dimension ≦ 2 and local embedding dimension ≦ 3 has the property if and only if it is coherent and all its germs have the property. If that is the case, every positive semidefinite analytic function on X is a sum of squares of analytic functions on X. Moreover, we classify the singularities with the property.

At the 1900 International Congress of Mathematicians, held that year in Paris, the German mathematician David Hilbert put forth a list of 23 problems that he saw as being the greatest challenges for twentieth-century mathematics. Hilbert's 10th problem, to find a method (what we now call an algorithm) for deciding whether a Diophantine equation has an integral solution, was solved by Yuri Matiyasevich in 1970. Proving the undecidability of Hilbert's 10th problem is clearly one of the great mathematical results of the century.This book presents the full, self-contained negative solution of Hilbert's 10th problem. In addition it contains a number of diverse, often striking applications of the technique developed for that solution (scattered previously in journals), describes the many improvements and modifications of the original proof - since the problem was unsolved 20 years ago, and adds several new, previously unpublished proofs.Included are numerous exercises that range in difficulty from the elementary to small research problems, open questions,and problems. Each chapter concludes with a commentary providing a historical view of its contents. And an extensive bibliography contains references to all of the main publications directed to the negative solution of Hilbert's 10th problem as well as the majority of the publications dealing with applications of the solution.Intended for young mathematicians, Hilbert's 10th Problem requires only a modest mathematical background. A few less well known number-theoretical results are presented in the appendixes. No knowledge of recursion theory is presupposed. All necessary notions are introduced and defined in the book, making it suitable for the first acquaintance with this fascinating subject.Yuri Matiyasevich is Head of the Laboratory of Mathematical Logic, Steklov Institute of Mathematics, Russian Academy of Sciences, Saint Petersburg.

In this chapter we deal with abelian integrals. They play a key role in the infinitesimal version of the 16th Hilbert problem. Recall that 16th Hilbert problem and its ramifications is one of the principal research subject of Christiane Rousseau and of the first author. We recall briefly the definition and explain the role of abelian integrals in 16th Hilbert problem. We also give a simple well-known proof of a property of abelian integrals. The reason for presenting it here is that it serves as a model for more complicated and more original treatment of abelian integrals in the study of Hamiltonian monodromy of fully integrable systems, which is the main subject of this chapter. We treat in particular the simplest example presenting non-trivial Hamiltonian monodromy: the spherical pendulum.

Small limit cycles bifurcating from fine focus points in quartic order Z 3-equivariant vector fields

On the second part of Hilbert's 16th problem

PP-graphics with a nilpotent elliptic singularity in quadratic systems and Hilbert's 16th problem

Hermitian analogues of Hilbert's 17-th problem

In 1957, Kolmogorov and Arnold gave a solution to the 13th problem which had been formulated by Hilbert in 1900. Actually, it is known that there exist many open problems which can be derived from the original problem. From the function-theoretic point of view, Hilbert's 13th problem can be exactly characterized as the superposition representability problem for continuous functions of several variables. In this paper, the solution to the superposition representability problem for infinitely differentiable functions of several variables is given.

Understanding quantum phenomena that go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of non-negative polynomials emerging around Hilbert's 17th problem, can be used to optimally exploit data capturing the nonclassical nature of light. Specifically, we show that non-negative polynomials can reveal nonclassicality in data even when it is hidden from standard detection methods up to now. Moreover, the abstract language of non-negative polynomials also leads to a unified mathematical approach to nonclassicality for light and spin systems, allowing us to map methods for one to the other. Conversely, the physical problems arising also inspire several mathematical insights into characterization of non-negative polynomials.

The algebraic form of Hilbert's 13th problem asks for the resolvent degree \operatorname{RD}(n) of the general polynomial f(x) = x^n + a_1 x^{n-1} + \cdots + a_n of degree n , where a_1, \ldots, a_n are independent variables. The resolvent degree is the minimal integer d such that every root of f(x) can be obtained in a finite number of steps, starting with \mathbb{C}(a_1, \ldots, a_n) and adjoining algebraic functions in \leqslant\nobreak d variables at each step. Recently Farb and Wolfson defined the resolvent degree \operatorname{RD}_k(G) for every finite group G and any base field k of characteristic 0 . In this setting \operatorname{RD}(n) = \operatorname{RD}_{\mathbb{C}}(\operatorname{S}_n) , where \operatorname{S}_n denotes the symmetric group. In this paper we extend their definition of \operatorname{RD}_k(G) to an arbitrary algebraic {group} G over an arbitrary field k . We investigate the dependency of this quantity on k and show that \operatorname{RD}_k(G) \leqslant 5 for any field k and any connected group G . The question whether \operatorname{RD}_k(G) can be bigger than 1 for any field k and any algebraic group G over k (not necessarily connected) remains open.

Driven by recent telecommunication demand, shared communication channels are more abundant today than ever before. These shared wired/wireless networks for communication are being exploited more and more in control systems to connect sensors, controllers and actuators resulting in so-called networked control systems (NCSs). NCSs replace the more traditional control systems where dedicated point-to-point (wired) connections are being used. The advantages of using NCS technology are inexpensive and easily modifiable communication links which allow control algorithms to be easily implemented in situations where dedicated connections are not possible (either economically or physically). However, the drawback is that the control system is susceptible to undesirable (possibly destabilizing) side-effects such as time-varying transmission intervals, time-varying delays, packet dropouts, quantization and a shared communication medium. These network-induced effects undermine fundamental assumptions on which traditional control theory is built and, therefore, it is essential to develop new techniques and tools that can be used to analyze and/or design control systems which communicate via a shared network. This thesis advances NCS analysis and design methodologies by contributing new theoretical developments, new software tools and new experimental validation results. The first new theoretical development is in the area of analyzing robust stability properties with respect to network-induced effects. A sum of squares (SOS) approach for a class of nonlinear NCSs incorporating bounded time-varying delays, bounded time-varying transmission intervals and a shared communication medium is developed. Mathematical models that describe these nonlinear NCSs are cast into suitable hybrid system formulations. Based on these hybrid system formulations, (families of) Lyapunov functions are constructed using SOS techniques. Amongst other benefits, it is shown that this technique improves the guaranteed robustness margins compared to existing work. The second new theoretical development concerns the design of networkaware decentralized controllers guaranteeing robust stability properties with respect to network-induced effects. We develop one of the first approaches based on semidefinite programming techniques to synthesize stabilizing decentralized observer-based output-feedback controllers for linear plants where the controllers, sensors and actuators are connected via a shared communication network subject to time-varying transmission intervals and delays. To effectively deal with the shared communication medium, a switched observer structure is adopted that switches based on the transmitted measured outputs and a switched controller structure is also adopted that switches based on the transmitted control inputs at each transmission time. By taking a discrete-time switched linear system perspective on modeling these decentralized NCSs, we are able to derive a general model that captures all these networked and decentralized control aspects. We provide linear matrix inequality (LMI)-based synthesis conditions which, if satisfied, provide stabilizing observer-based controllers that are both decentralized and robust to network effects. Regarding new software tools, the first prototype of a toolbox is developed to automate (robust) stability analysis (and controller design) for NCSs. Specifically, it is shown that the toolbox can be employed to efficiently verify if a linear time-invariant (LTI) plant and an LTI controller interconnected with a shared network are robust to certain network imperfections. The main intention of the toolbox is to make the available theory readily accessible to and applicable for the general control community. Additionally, the chosen software structure enables the incorporation of custom models or custom stability/performance analysis conditions in an easy manner, thereby allowing the control community to contribute and to further develop the toolbox. Finally, an experimental case study involving a wirelessly controlled inverted pendulum/cart system is investigated. In particular, the communication network itself is analyzed such that the network-induced effects can be characterized in terms of bounds on the transmission intervals and transmission delays. Based on these bounds, the prototype toolbox is applied to analyze the robustness regions for different performance specifications, which aid in tuning the controller to achieve more closed-loop robustness with respect to the network-induced effects. This leads to a validation of the developed theory in an experimental setting. In addition to the validation of the developed theory, many new insights into the network behavior are obtained and explained, thereby raising new interesting questions for future research on NCSs.

This paper considers the linear quadratic optimal control problem for linear implicit systems based on the dissipation inequality. We derive a necessary and sufficient condition for the dissipativeness with respect to a quadratic supply rate in terms of a linear matrix inequality (LMI) condition with an equality constraint. Based on this constrained LMI condition, the optimal control law is given by an implicit algebraic constraint among system variables. We also show that the present constrained LMI condition easily reduces to an LMI without any equality constraints.

This paper discusses the robust stability and stabilization of polynomial fractional differential (PFD) systems with a Caputo derivative using the sum of squares. In addition, it presents a novel method of stability and stabilization for PFD systems. It demonstrates the feasibility of designing problems that cannot be represented in LMIs (linear matrix inequalities). First, sufficient conditions of stability are expressed for the PFD equation system. Based on the results, the fractional differential system is Mittag–Leffler stable when there is a polynomial function to satisfy the inequality conditions. These functions are obtained from the sum of the square (SOS) approach. The result presents a valuable method to select the Lyapunov function for the stability of PFD systems. Then, robust Mittag–Leffler stability conditions were able to demonstrate better convergence performance compared to asymptotic stabilization and a robust controller design for a PFD equation system with unknown system parameters, and design performance based on a polynomial state feedback controller for PFD-controlled systems. Finally, simulation results indicate the effectiveness of the proposed theorems.

Hilbert's 16th problem, about the maximum number of limit cycles of planar polynomial vector fields of a given degree , has been one of the most important driving forces for new developments in the qualitative theory of vector fields. Increasing the dimension, one cannot expect the existence of a finite upper bound for the number of limit cycles of, for instance, 3D polynomial vector fields of a given degree . Here, as an extension of such a problem in the 3D space, we investigate the number of isolated invariant tori in 3D polynomial vector fields. In this context, given a natural number , we denote by the upper bound for the number of isolated invariant tori of 3D polynomial vector fields of degree . Based on a recently developed averaging method for detecting invariant tori, our first main result provides a mechanism for constructing 3D differential vector fields with a number of normally hyperbolic invariant tori from a given planar differential vector field with hyperbolic limit cycles. The strength of our mechanism in studying the number lies in the fact that the constructed 3D differential vector field is polynomial provided that the given planar differential vector field is polynomial. Accordingly, our second main result establishes a lower bound for in terms of lower bounds for the number of hyperbolic limit cycles of planar polynomial vector fields of degree . Based on this last result, we apply a methodology due to Christopher and Lloyd to show that grows as fast as . Finally, the above‐mentioned problem is also formulated for higher dimensional polynomial vector fields.