21 pagesWe 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
In this paper, we show that local exponential stability of a polynomial vector field implies the exi...
We present a methodology for the algorithmic construction of Lyapunov functions for the transient st...
This paper introduces a general framework for analysing nonlinear systems using absolute stability t...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
In this paper we analyze locally asymptotic stability of polynomial dynamical systems by discovering...
Abstract—Sum of Squares programming has been used exten-sively over the past decade for the stabilit...
Sum of Squares programming has been used extensively over the past decade for the stability analysis...
A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic ...
Abstract: We investigate linear programming relaxations to synthesize Lyapunov functions that es-tab...
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical syste...
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
We present a methodology for the algorithmic construction of Lyapunov functions for the transient st...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
We examine linear programming (LP) based relaxations for synthesizing polynomial Lyapunov functions ...
In this paper, we show that local exponential stability of a polynomial vector field implies the exi...
We present a methodology for the algorithmic construction of Lyapunov functions for the transient st...
This paper introduces a general framework for analysing nonlinear systems using absolute stability t...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
In this paper we analyze locally asymptotic stability of polynomial dynamical systems by discovering...
Abstract—Sum of Squares programming has been used exten-sively over the past decade for the stabilit...
Sum of Squares programming has been used extensively over the past decade for the stability analysis...
A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic ...
Abstract: We investigate linear programming relaxations to synthesize Lyapunov functions that es-tab...
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical syste...
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
We present a methodology for the algorithmic construction of Lyapunov functions for the transient st...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
We examine linear programming (LP) based relaxations for synthesizing polynomial Lyapunov functions ...
In this paper, we show that local exponential stability of a polynomial vector field implies the exi...
We present a methodology for the algorithmic construction of Lyapunov functions for the transient st...
This paper introduces a general framework for analysing nonlinear systems using absolute stability t...