z-logo
open-access-imgOpen Access
Computation of Lyapunov functions for systems with multiple local attractors
Author(s) -
Jóhann Björnsson,
Peter Giesl,
Sigurður Hafstein,
Christopher M. Kellett
Publication year - 2015
Publication title -
discrete and continuous dynamical systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.289
H-Index - 70
eISSN - 1553-5231
pISSN - 1078-0947
DOI - 10.3934/dcds.2015.35.4019
Subject(s) - attractor , lyapunov function , lyapunov exponent , mathematics , lyapunov equation , computation , lyapunov redesign , lyapunov optimization , function (biology) , computer science , mathematical analysis , nonlinear system , algorithm , physics , artificial intelligence , chaotic , quantum mechanics , evolutionary biology , biology
We present a novel method to compute Lyapunov functions for continuous-time systems with multiple local attractors. In the proposed method one first computes an outer approximation of the local attractors using a graphtheoretic approach. Then a candidate Lyapunov function is computed using a Massera-like construction adapted to multiple local attractors. In the final step this candidate Lyapunov function is interpolated over the simplices of a simplicial complex and, by checking certain inequalities at the vertices of the complex, we can identify the region in which the Lyapunov function is decreasing along system trajectories. The resulting Lyapunov function gives information on the qualitative behavior of the dynamics, including lower bounds on the basins of attraction of the individual local attractors. We develop the theory in detail and present numerical examples demonstrating the applicability of our method

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom