Advertisement

Computational Approach for Complete Lyapunov Functions

Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 248)

Abstract

Ordinary differential equations arise in a variety of applications, including climate modeling, electronics, predator-prey modeling, etc., and they can exhibit highly complicated dynamical behaviour. Complete Lyapunov functions capture this behaviour by dividing the phase space into two disjoint sets: the chain-recurrent part and the transient part. If a complete Lyapunov function is known for a dynamical system the qualitative behaviour of the system’s solutions is transparent to a large degree. The computation of a complete Lyapunov function for a given system is, however, a very hard task. We present significant improvements of an algorithm recently suggested by the authors to compute complete Lyapunov functions. Previously this methodology was incapable to fully detect chain-recurrent sets in dynamical systems with high differences in speed. In the new approach we replace the system under consideration with another one having the same solution trajectories but such that they are traversed at a more uniform speed. The qualitative properties of the new system such as attractors and repellers are the same as for the original one. This approach gives a better approximation to the chain-recurrent set of the system under study.

Keywords

Complete Lyapunov Function Dynamical Systems Lyapunov theory Meshless collocation Radial Basis Functions 

Notes

Acknowledgements

The first author in this paper is supported by the Icelandic Research Fund (Rannís) grant number 163074-052, Complete Lyapunov functions: Efficient numerical computation. Special thanks to Dr. Jean-Claude Berthet for all his good comments and advice on C++.

References

  1. 1.
    Lyapunov, A.M.: The general problem of the stability of motion. Int. J. Control 3(55), 521–790 (1992)MathSciNetGoogle Scholar
  2. 2.
    Conley, C.: Isolated Invariant Sets and the Morse Index. In: American Mathematical Society, CBMS Regional Conference Series, vol. 38 (1978)Google Scholar
  3. 3.
    Conley, C.: The gradient structure of a flow I. Ergodic Theory Dynam. Syst. 8, 11–26 (1988)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Hurley, M.: Chain recurrence, semiflows, and gradients. J. Dyn. Diff. Equat. 3(7), 437–456 (1995)Google Scholar
  5. 5.
    Hurley, M.: Lyapunov functions and attractors in arbitrary metric spaces. Proc. Amer. Math. Soc. 126, 245–256 (1998)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Awrejcewicza, J., Wasilewskia, G., Kudra, G., Reshminb, S.: An experiment with swinging up a double pendulum using feedback control. J. Comput. Syst. Sci. Int. 51(2), 176–182 (2012)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Awrejcewicz, J., Kudra, G., Wasilewski, G.: Experimental and numerical investigation of chaotic regions in the triple physical pendulum. Nonlinear Dyn 50, 755–766 (2007)CrossRefGoogle Scholar
  8. 8.
    Awrejcewicz, J., Kudra, G., Wasilewski, G.: Chaotic zones in triple pendulum dynamics observed experimentally and numerically. Appl. Mech. Mater. 9, 1–17 (2008)Google Scholar
  9. 9.
    Awrejcewicz, J., Kudra, G.: Mathematical modelling and simulation of the bifurcational wobblestone dynamics. Discontinuity, Nonlinearity, Complexity 3(2), 123–132 (2014)CrossRefGoogle Scholar
  10. 10.
    Krauskopf, B., Osinga, H., Doedel, E.J., Henderson, M., Guckenheimer, J., Vladimirsky, A., Dellnitz, M., Junge, O.: A survey of methods for computing (un)stable manifolds of vector fields. Internat. J. Bifur. Chaos Appl. Sci. Engrg., 3(15), 763–791Google Scholar
  11. 11.
    Hsu, C. S.: Cell-to-cell mapping. In: Applied Mathematical Sciences. vol. 64. Springer-Verlag, New York (1987).  https://doi.org/10.1007/978-1-4757-3892-6
  12. 12.
    Dellnitz, M., Junge, O.: Set oriented numerical methods for dynamical systems. In: Handbook of Dynamical Systems, vol. 2, pp. 221–264. North-Holland, Amsterdam (2002).  https://doi.org/10.1016/S1874-575X(02)80026-1
  13. 13.
    Osipenko, G.: Dynamical systems, graphs, and algorithms. In: Lecture Notes in Mathematics. vol. 1889. Springer-Verlag, Berlin (2007)Google Scholar
  14. 14.
    Kalies, W., Mischaikow, K., VanderVorst, R.: An algorithmic approach to chain recurrence. Found. Comput. Math. 4, 409–449 (2005)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Dellnitz, M., Froyland, G., Junge, O.: The algorithms behind GAIO - set oriented numerical methods for dynamical systems. Ergodic Theory. Analysis, and Efficient Simulation of Dynamical Systems, pp. 145–174. Springer, Berlin (2001)Google Scholar
  16. 16.
    Ban, H., Kalies, W.: A computational approach to Conley’s decomposition theorem. J. Comput. Nonlinear Dynam. 1(4 ), 312–319 (2006)Google Scholar
  17. 17.
    Argáez, C., Giesl, P., Hafstein, S.: Analysing dynamical systems – towards computing complete lyapunov functions. In: Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications – Volume 1: SIMULTECH, pp. 134–144 (2017)Google Scholar
  18. 18.
    Giesl, P.: Construction of Global Lyapunov Functions Using Radial Basis Functions. In: Lecture Notes in Math., vol. 1904. Springer (2007)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Science InstituteUniversity of IcelandReykjavíkIceland
  2. 2.Department of MathematicsUniversity of SussexFalmerUK

Personalised recommendations