Minimization with differential inequality constraints applied to complete Lyapunov functions

Giesl, Peter; Argáez, Carlos; Hafstein, Sigurdur; Wendland, Holger

doi:10.1090/mcom/3629

Minimization with differential inequality constraints applied to complete Lyapunov functions
HTML articles powered by AMS MathViewer

by Peter Giesl, Carlos Argáez, Sigurdur Hafstein and Holger Wendland HTML | PDF

Math. Comp. 90 (2021), 2137-2160 Request permission

Abstract:

Motivated by the desire to compute complete Lyapunov functions for nonlinear dynamical systems, we develop a general theory of discretizing a certain type of continuous minimization problems with differential inequality constraints. The resulting discretized problems are quadratic optimization problems, for which there exist efficient solution algorithms, and we show that their unique solutions converge strongly in appropriate Sobolev spaces to the unique solution of the original continuous problem. We develop the theory and present examples of our approach, where we compute complete Lyapunov functions for nonlinear dynamical systems.

A complete Lyapunov function characterizes the behaviour of a general dynamical system. In particular, the state space is divided into the chain-recurrent set, where the complete Lyapunov function is constant along solutions, and the part characterizing the gradient-like flow, where the complete Lyapunov function is strictly decreasing along solutions. We propose a new method to compute a complete Lyapunov function as the solution of a quadratic minimization problem, for which no information about the chain-recurrent set is required. The solutions to the discretized problems, which can be solved using quadratic programming, converge to the complete Lyapunov function.

References

Robert A. Adams, Sobolev spaces, Pure and Applied Mathematics, Vol. 65, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1975. MR 0450957
C. Argáez, J.-C. Berthet, H. Björnsson, P. Giesl, and S. Hafstein, LyapXool – a program to compute complete Lyapunov functions., SoftwareX 10 (2019), Article 100325., DOI 10.1016/j.softx.2019.100325
C. Argáez, P. Giesl, and S. Hafstein, Analysing dynamical systems towards computing complete Lyapunov functions, Proceedings of the 7th international conference on simulation and modeling methodologies, technologies and applications, Madrid, Spain, 2017, pp. 323–330.
C. Argáez, P. Giesl, and S. Hafstein, Computational approach for complete Lyapunov functions, Dynamical systems in theoretical perspective, Springer Proceedings in Mathematics & Statistics. ed. Awrejcewicz J. (eds.), 2018, pp. 1–11.
C. Argáez, P. Giesl, and S. Hafstein, Iterative construction of complete Lyapunov functions: Analysis of algorithm efficiency, Simulation and modeling methodologies, technologies and applications, 2020, pp. 83–100., DOI 10.1007/978-3-030-35944-7_{5}
C. Argáez, P. Giesl, and S. Hafstein, Update (2.0) to LyapXool: Eigenpairs and new classification methods, SoftwareX 12 (2020), Article 100616., DOI 10.1016/j.softx.2020.100616
N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 68 (1950), 337–404. MR 51437, DOI 10.1090/S0002-9947-1950-0051437-7
Joseph Auslander, Generalized recurrence in dynamical systems, Contributions to Differential Equations 3 (1964), 65–74. MR 162238
H. Ban and W. Kalies, A computational approach to Conley’s decomposition theorem, J. Comput. Nonlinear Dynam 1 (2006), no. 4, 312–319., DOI 10.1115/1.2338651
Patrick Bernard and Stefan Suhr, Lyapounov functions of closed cone fields: from Conley theory to time functions, Comm. Math. Phys. 359 (2018), no. 2, 467–498. MR 3783554, DOI 10.1007/s00220-018-3127-7
Jóhann Björnsson, Peter Giesl, Sigurdur F. Hafstein, and Christopher M. Kellett, Computation of Lyapunov functions for systems with multiple local attractors, Discrete Contin. Dyn. Syst. 35 (2015), no. 9, 4019–4039. MR 3392616, DOI 10.3934/dcds.2015.35.4019
Vladimir A. Boichenko, Gennadij A. Leonov, and Volker Reitmann, Dimension theory for ordinary differential equations, Teubner-Texte zur Mathematik [Teubner Texts in Mathematics], vol. 141, B. G. Teubner Verlagsgesellschaft mbH, Stuttgart, 2005. MR 2381409, DOI 10.1007/978-3-322-80055-8
Susanne C. Brenner and L. Ridgway Scott, The mathematical theory of finite element methods, 3rd ed., Texts in Applied Mathematics, vol. 15, Springer, New York, 2008. MR 2373954, DOI 10.1007/978-0-387-75934-0
Charles Conley, Isolated invariant sets and the Morse index, CBMS Regional Conference Series in Mathematics, vol. 38, American Mathematical Society, Providence, R.I., 1978. MR 511133, DOI 10.1090/cbms/038
Michael Dellnitz, Gary Froyland, and Oliver Junge, The algorithms behind GAIO-set oriented numerical methods for dynamical systems, Ergodic theory, analysis, and efficient simulation of dynamical systems, Springer, Berlin, 2001, pp. 145–174, 805–807. MR 1850305
Albert Fathi and Pierre Pageault, Smoothing Lyapunov functions, Trans. Amer. Math. Soc. 371 (2019), no. 3, 1677–1700. MR 3894031, DOI 10.1090/tran/7329
Peter Giesl, Construction of global Lyapunov functions using radial basis functions, Lecture Notes in Mathematics, vol. 1904, Springer, Berlin, 2007. MR 2313542, DOI 10.1007/978-3-540-69909-5
P. Giesl, C. Argáez, S. Hafstein, and H. Wendland, Construction of a complete Lyapunov function using quadratic programming, Proceedings of the 15th international conference on informatics in control, automation and robotics, 2018, pp. 560–568.
Peter Giesl and Holger Wendland, Meshless collocation: error estimates with application to dynamical systems, SIAM J. Numer. Anal. 45 (2007), no. 4, 1723–1741. MR 2338407, DOI 10.1137/060658813
A. Goullet, S. Harker, K. Mischaikow, W. Kalies, and D. Kasti, Efficient computation of Lyapunov functions for Morse decompositions, Discrete Contin. Dyn. Syst. Ser. B 20 (2015), no. 8, 2419–2451., DOI 10.3934/dcdsb.2015.20.2419
Sigurdur Hafstein and Christoph Kawan, Numerical approximation of the data-rate limit for state estimation under communication constraints, J. Math. Anal. Appl. 473 (2019), no. 2, 1280–1304. MR 3912878, DOI 10.1016/j.jmaa.2019.01.022
Mike Hurley, Chain recurrence and attraction in noncompact spaces, Ergodic Theory Dynam. Systems 11 (1991), no. 4, 709–729. MR 1145617, DOI 10.1017/S014338570000643X
Mike Hurley, Noncompact chain recurrence and attraction, Proc. Amer. Math. Soc. 115 (1992), no. 4, 1139–1148. MR 1098401, DOI 10.1090/S0002-9939-1992-1098401-X
Mike Hurley, Chain recurrence, semiflows, and gradients, J. Dynam. Differential Equations 7 (1995), no. 3, 437–456. MR 1348735, DOI 10.1007/BF02219371
Mike Hurley, Lyapunov functions and attractors in arbitrary metric spaces, Proc. Amer. Math. Soc. 126 (1998), no. 1, 245–256. MR 1458880, DOI 10.1090/S0002-9939-98-04500-6
A. Iske, Perfect centre placement for radial basis function methods, Technical Report TUM-M9809, 1998.
W. D. Kalies, K. Mischaikow, and R. C. A. M. VanderVorst, An algorithmic approach to chain recurrence, Found. Comput. Math. 5 (2005), no. 4, 409–449. MR 2189545, DOI 10.1007/s10208-004-0163-9
Lawrence Perko, Differential equations and dynamical systems, 3rd ed., Texts in Applied Mathematics, vol. 7, Springer-Verlag, New York, 2001. MR 1801796, DOI 10.1007/978-1-4613-0003-8
Elias M. Stein, Singular integrals and differentiability properties of functions, Princeton Mathematical Series, No. 30, Princeton University Press, Princeton, N.J., 1970. MR 0290095
Sigurdur Hafstein and Stefan Suhr, Smooth complete Lyapunov functions for ODEs, J. Math. Anal. Appl. 499 (2021), no. 1, Paper No. 125003, 15. MR 4207325, DOI 10.1016/j.jmaa.2021.125003
Holger Wendland, Error estimates for interpolation by compactly supported radial basis functions of minimal degree, J. Approx. Theory 93 (1998), no. 2, 258–272. MR 1616781, DOI 10.1006/jath.1997.3137
Holger Wendland, Scattered data approximation, Cambridge Monographs on Applied and Computational Mathematics, vol. 17, Cambridge University Press, Cambridge, 2005. MR 2131724