Review on computational methods for Lyapunov functions

By Peter Giesl, Sigurdur Freyr Hafstein. 2015

275 citations recorded by the source corpus.

Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ different methods such as series expan- sion, linear programming, linear matrix inequalities, collocation methods, al- gebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function.

Subfields: Control and Systems Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

  1. Sicun Gao
  2. Andreas Krause
  3. Felix Berkenkamp
  4. Angela P. Schoellig
  5. Matteo Turchetta
  6. Charles Dawson
  7. Chuchu Fan
  8. Melanie Nicole Zeilinger

Citations in the corpus