Computation and verification of contraction metrics for exponentially stable equilibria

09/20/2019
by   Peter Giesl, et al.
0

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.

READ FULL TEXT

page 24

page 25

page 26

page 27

research
11/06/2020

Neural Stochastic Contraction Metrics for Robust Control and Estimation

We present neural stochastic contraction metrics, a new design framework...
research
10/02/2021

A Theoretical Overview of Neural Contraction Metrics for Learning-based Control with Guaranteed Stability

This paper presents a theoretical overview of a Neural Contraction Metri...
research
07/17/2019

Optimization of a partial differential equation on a complex network

Differential equations on metric graphs can describe many phenomena in t...
research
01/28/2018

Wasserstein-Riemannian Geometry of Positive-definite Matrices

The Wasserstein distance on multivariate non-degenerate Gaussian densiti...
research
01/17/2022

Generalization in Supervised Learning Through Riemannian Contraction

We prove that Riemannian contraction in a supervised learning setting im...
research
12/20/2019

A vector-contraction inequality for Rademacher complexities using p-stable variables

Andreas Maurer in the paper "A vector-contraction inequality for Rademac...
research
05/01/2016

A vector-contraction inequality for Rademacher complexities

The contraction inequality for Rademacher averages is extended to Lipsch...

Please sign up or login with your details

Forgot password? Click here to reset