Polynomial level-set method for attractor estimation

Abstract In this study, we present a polynomial level-set method for attractor estimation. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamic system is converted to a semi-definite program, which is used to compute the coefficients of the polynomials. The required storage space for describing the result is much less than the mesh-based methods. The characteristics of attractors are used in the algorithm formulations so that the associated numerical error can be reduced. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are used to show the effectiveness of the advection approach.

[1]  Bernd Krauskopf,et al.  Computing Geodesic Level Sets on Global (Un)stable Manifolds of Vector Fields , 2003, SIAM J. Appl. Dyn. Syst..

[2]  Sanjay Lall,et al.  Polynomial Method for PLL Controller Optimization† , 2011, Sensors.

[3]  John Guckenheimer,et al.  A Survey of Methods for Computing (un)Stable Manifolds of Vector Fields , 2005, Int. J. Bifurc. Chaos.

[4]  Franco Blanchini,et al.  Robust performance with fixed and worst-case signals for uncertain time-varying systems , 1997, Autom..

[5]  A. Prestel,et al.  Distinguished representations of strictly positive polynomials , 2001 .

[6]  G K Rohde,et al.  Chaotic signal detection and estimation based on attractor sets: applications to secure communications. , 2008, Chaos.

[7]  David Q. Mayne,et al.  Robust output feedback model predictive control of constrained linear systems , 2006, Autom..

[8]  Bernd Krauskopf,et al.  COVER ILLUSTRATION: The Lorenz manifold as a collection of geodesic level sets , 2004 .

[9]  Pablo A. Parrilo,et al.  Semidefinite Programming Relaxations and Algebraic Optimization in Control , 2003, Eur. J. Control.

[10]  Mark E. Johnson,et al.  Two-dimensional invariant manifolds and global bifurcations: some approximation and visualization studies , 1997, Numerical Algorithms.

[11]  S. Wiggins.  Introduction to Applied Nonlinear Dynamical Systems and Chaos , 1989 .

[12]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[13]  E. Lorenz.  Deterministic nonperiodic flow , 1963 .

[14]  P. Holmes,et al.  Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields , 1983, Applied Mathematical Sciences.

[15]  Alexander S. Poznyak,et al.  Invariant ellipsoid method for minimization of unmatched disturbances effects in sliding mode control , 2011, Autom..

[16]  Michael Margaliot,et al.  Stability analysis of switched systems using variational principles: An introduction , 2006, Autom..

[17]  Prashant Mhaskar,et al.  On Constructing Constrained Control Lyapunov Functions for Linear Systems , 2011, IEEE Transactions on Automatic Control.

[18]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[19]  John Guckenheimer,et al.  Dynamical Systems: Some Computational Problems , 1993, chao-dyn/9304010.

[20]  MargaliotMichael.  Stability analysis of switched systems using variational principles , 2006 .

[21]  Michael Dellnitz,et al.  Chapter 5 - Set Oriented Numerical Methods for Dynamical Systems , 2002 .

[22]  Robert Shorten,et al.  Stability Criteria for Switched and Hybrid Systems , 2007, SIAM Rev..

[23]  Pablo A. Parrilo,et al.  Introducing SOSTOOLS: a general purpose sum of squares programming solver , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[24]  Michael Margaliot,et al.  Necessary and sufficient conditions for absolute stability: the case of second-order systems , 2003 .

[25]  Pei Yu,et al.  Necessary and Sufficient Conditions for Absolute Stability , 2008 .