Search arXivSearch

arXiv · 1909.10334

Computation and verification of contraction metrics for exponentially stable equilibria

Abstract

The determination of exponentially stable equilibria and their basin of attraction for a dynamical system given by a general autonomous ordinary differential equation can be achieved by means of a contraction metric. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions decreases as time increases. The Riemannian metric can be expressed by a matrix-valued function on the phase space. The determination of a contraction metric can be achieved by approximately solving a matrix-valued partial differential equation by mesh-free collocation using Radial Basis Functions (RBF). However, so far no rigorous verification that the computed metric is indeed a contraction metric has been provided. In this paper, we combine the RBF method to compute a contraction metric with the CPA method to rigorously verify it. In particular, the computed contraction metric is interpolated by a continuous piecewise affine (CPA) metric at the vertices of a fixed triangulation, and by checking finitely many inequalities, we can verify that the interpolation is a contraction metric. Moreover, we show that, using sufficiently dense collocation points and a sufficiently fine triangulation, we always succeed with the construction and verification. We apply the method to two examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Giesl, Sigurdur Hafstein, Iman Mehrabinezhad. 2019-09-20. Computation and verification of contraction metrics for exponentially stable equilibria. https://arxiv.org/abs/1909.10334

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Monotonicity, global symplectification and the stability of Dry Ten Martini Problem

We prove that, for every irrational frequency and every analytic Type I potential, each supercritical spectral energy satisfying the gap-labelling condition is an endpoint of an open spectral gap. This establishes the conjecture of Ge--Jitomirskaya--You \cite{GJY,You} in the supercritical regime. Consequently, the ``all gaps open'' property of the supercritical almost Mathieu operator persists under sufficiently small analytic perturbations. The main ingredient is a global symplectification of the center bundle that preserves quantitative monotonicity. This allows us to study gap opening through the center dynamics of the dual long-range operator, which has no natural Schrödinger form. We first establish the result for trigonometric polynomial potentials and then pass to general analytic potentials by controlling the dependence on the truncation dimension. The proof combines a discrete Hellmann--Feynman identity, dimension-free Aubry duality in weighted analytic norms, and a quantitative cone argument based on pre-monotonicity. These estimates ensure that the gaps survive in the analytic limit. Our results establish analytic stability of the Dry Ten Martini Problem in the supercritical regime and give a partial answer to a question of M. Shamis on the persistence of periodic spectral gaps.

math.DS

Asymmetry of a class of Mellin transforms via bounded solutions

We introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter $s$ in the critical strip. We identify sufficient conditions on the non-homogeneous term that induce a structural asymmetry between the solutions corresponding to the parameters $s$ and $1-s$. More precisely, if both solutions with initial value $1$ are bounded on $[1,\infty)$, then necessarily $\Re(s)=\tfrac12$. The initial condition associated with the unique bounded solution corresponding to a parameter $s$ represents a zero of the Mellin transform associated with the non-homogeneous term at the point $s$.

math.DS

Self-similar Delone sets and Pisot numbers

We consider Delone point patterns with self-similarity. Under mild conditions, the similarity factor is a Pisot number if and only if the pattern is uniformly discrete. The classical case is a Meyer set $Λ$ with $Λ\supset θΛ$ for some $θ>1,$ for which $θ$ must be a Pisot number or a Salem number. When $Λ$ contains several similar copies of itself, the case of a Salem number drops out for $θ<2.$ On the other hand, strictly self-similar patterns with a Pisot factor must be Meyer sets. Various examples are given.

math.DS