Mohammed, Najla and Giesl, Peter (2022) Modified refinement algorithm to construct lyapunov functions using meshless collocation. Journal of Computational Dynamics. pp. 1-25. ISSN 2158-2491

PDF (This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Journal of Computational Dynamics (JCD) following peer review.) - Accepted Version Available under License Creative Commons Attribution. Download (1MB)

Abstract

Contraction analysis considers the distance between two adjacent trajectories. If this distance is contracting, then trajectories have the same long-term behavior. The main advantage of this analysis is that it is independent of the solutions under consideration. Using an appropriate metric, with respect to which the distance is contracting, one can show convergence to a unique equilibrium or, if attraction only occurs in certain directions, to a periodic orbit.
Contraction analysis was originally considered for ordinary differential equations, but has been extended to discrete-time systems, control systems, delay equations and many other types of systems. Moreover, similar techniques can be applied for the estimation of the dimension of attractors and for the estimation of different notions of entropy (including topological entropy).
This review attempts to link the references in both the mathematical and the engineering literature and, furthermore, point out the recent developments and algorithms in the computation of contraction metrics.

Item Type:	Article
Additional Information:	This article has been published in a revised form in Journal of Computational Dynamics http://dx.doi.org/10.3934/jcd.2022022. This version is free to download for private research and study only. Not for redistribution, re-sale or use in derivative works.”
Schools and Departments:	School of Mathematical and Physical Sciences > Mathematics
Research Centres and Groups:	Analysis and Partial Differential Equations Research Group
SWORD Depositor:	Mx Elements Account
Depositing User:	Mx Elements Account
Date Deposited:	01 Apr 2022 07:42
Last Modified:	02 Sep 2022 10:30
URI:	http://sro.sussex.ac.uk/id/eprint/105111

View download statistics for this item

📧 Request an update