International audienceWe consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs with spatially varying coefficients and systems of in-domain/boundary coupled PDEs. Our approach is Lyapunov based which allows us to reduce the stability problem to verification of integral inequalities on the subspaces of Hilbert spaces. Then, using the fundamental theorem of calculus and Green's theorem, we construct a polynomial optimization problem to verify the integral inequalities. Constraining the solution of the polynomial optimization problem to belong to the set of sum-of-squares polynomials subject to affine constraints allows us to use semi-de...
In this paper we deal with the problem of computing Lyapunov functions for stability verification of...
We study one-dimensional integral inequalities, with quadratic integrands, on bounded domains. Condi...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
International audienceWe consider the stability analysis of a large class of linear 1-D PDEs with po...
This paper studies scalar integral inequalities in one-dimensional bounded domains with polynomial i...
International audienceWe present a method for the stability analysis of a large class of linear Part...
In this dissertation, computational methods based on convex optimization, for the analysis of syste...
We provide an algorithmic approach for the analysis of infinite dimensional systems described by Par...
International audienceThis work deals with a stability problem for a system coupling an ordinary dif...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
A relaxation of Lyapunov's direct method has been proposed recently that allows for an algorithmic c...
abstract: A computational framework based on convex optimization is presented for stability analysis...
We examine linear programming (LP) based relaxations for synthesizing polynomial Lyapunov functions ...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
In this paper we deal with the problem of computing Lyapunov functions for stability verification of...
In this paper we deal with the problem of computing Lyapunov functions for stability verification of...
We study one-dimensional integral inequalities, with quadratic integrands, on bounded domains. Condi...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
International audienceWe consider the stability analysis of a large class of linear 1-D PDEs with po...
This paper studies scalar integral inequalities in one-dimensional bounded domains with polynomial i...
International audienceWe present a method for the stability analysis of a large class of linear Part...
In this dissertation, computational methods based on convex optimization, for the analysis of syste...
We provide an algorithmic approach for the analysis of infinite dimensional systems described by Par...
International audienceThis work deals with a stability problem for a system coupling an ordinary dif...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
A relaxation of Lyapunov's direct method has been proposed recently that allows for an algorithmic c...
abstract: A computational framework based on convex optimization is presented for stability analysis...
We examine linear programming (LP) based relaxations for synthesizing polynomial Lyapunov functions ...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
In this paper we deal with the problem of computing Lyapunov functions for stability verification of...
In this paper we deal with the problem of computing Lyapunov functions for stability verification of...
We study one-dimensional integral inequalities, with quadratic integrands, on bounded domains. Condi...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...