Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis

06/17/2020
by   Grigory Devadze, et al.
0

We provide a computer-assisted approach to ensure that a given continuous or discrete-time polynomial system is (asymptotically) stable. Our framework relies on constructive analysis together with formally certified sums of squares Lyapunov functions. The crucial steps are formalized within of the proof assistant Minlog. We illustrate our approach with various examples issued from the control system literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2021

Windmills of the minds: an algorithm for Fermat's Two Squares Theorem

The two squares theorem of Fermat is a gem in number theory, with a spec...
research
03/11/2019

How far away must forced letters be so that squares are still avoidable?

We describe a new non-constructive technique to show that squares are av...
research
11/11/2017

Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis

We present an interval approach to real-number computations. In some asp...
research
04/06/2021

Extraction of a computer-certified ODE solver

Reliably determining system trajectories is essential in many analysis a...
research
03/12/2021

Packing Squares into a Disk with Optimal Worst-Case Density

We provide a tight result for a fundamental problem arising from packing...
research
09/04/2023

Partial Proof of a Conjecture with Implications for Spectral Majorization

In this paper we report on new results relating to a conjecture regardin...
research
11/28/2019

Manipulating Elections by Selecting Issues

Constructive election control considers the problem of an adversary who ...

Please sign up or login with your details

Forgot password? Click here to reset