### Abstract

In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.

Original language | English (US) |
---|---|

Article number | 7040246 |

Pages (from-to) | 5481-5487 |

Number of pages | 7 |

Journal | Unknown Journal |

Volume | 2015-February |

Issue number | February |

DOIs | |

State | Published - 2014 |

### Fingerprint

### ASJC Scopus subject areas

- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization

### Cite this

*Unknown Journal*,

*2015-February*(February), 5481-5487. [7040246]. https://doi.org/10.1109/CDC.2014.7040246

**Constructing piecewise-polynomial lyapunov functions for local stability of nonlinear systems using Handelman's theorem.** / Kamyar, Reza; Murti, Chaitanya; Peet, Matthew.

Research output: Contribution to journal › Article

*Unknown Journal*, vol. 2015-February, no. February, 7040246, pp. 5481-5487. https://doi.org/10.1109/CDC.2014.7040246

}

TY - JOUR

T1 - Constructing piecewise-polynomial lyapunov functions for local stability of nonlinear systems using Handelman's theorem

AU - Kamyar, Reza

AU - Murti, Chaitanya

AU - Peet, Matthew

PY - 2014

Y1 - 2014

N2 - In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.

AB - In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman's theorem, we derive a new set of affine feasibility conditions -solvable by linear programming- on each sub-polytope. Any solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. This is the first result which utilizes Handelman's theorem and decomposition to construct piecewise polynomial Lyapunov functions on arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of certain semi-definite programs associated with alternative methods based on Sum-of-Squares or Polya's theorem. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of the reverse-time Van Der Pol oscillator.

UR - http://www.scopus.com/inward/record.url?scp=84988041809&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988041809&partnerID=8YFLogxK

U2 - 10.1109/CDC.2014.7040246

DO - 10.1109/CDC.2014.7040246

M3 - Article

AN - SCOPUS:84988041809

VL - 2015-February

SP - 5481

EP - 5487

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

IS - February

M1 - 7040246

ER -