Related papers: Lifted polytope methods for stability analysis of …
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component signals into simple oscillatory mono-components, like the groundbreaking Empirical Mode…
Estimation of the degree of stability and the bounds of solutions to non-autonomous nonlinear systems present major concerns in numerous applied problems. Yet, current techniques are frequently yield overconservative conditions which are…
Mathematical proofs are a cornerstone of control theory, and it is important to get them right. Deduction systems can help with this by mechanically checking the proofs. However, the structure and level of detail at which a proof is…
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. We first propose an exact sequential lifting algorithm for…
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…
This paper addresses the stability problem for discrete-time switched systems under autonomous switching. Each mode of the switched system is modeled as a Linear Parameter Varying (LPV) system, the time-varying parameters can vary…
An input-output approach to stability analysis is explored for networked systems with uncertain link dynamics. The main result consists of a collection of integral quadratic constraints, which together imply robust stability of the…
We consider bimodal planar switched linear systems and obtain dwell time bounds which guarantee their asymptotic stability. The dwell time bound obtained is a smooth function of the eigenvectors and eigenvalues of the subsystem matrices. An…
We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…
This article provides a characterization of stability for switched nonlinear systems under average dwell-time constraints, in terms of necessary and sufficient conditions involving multiple Lyapunov functions. Earlier converse results focus…
State space subspace algorithms for input-output systems have been widely applied but also have a reasonably well-developedasymptotic theory dealing with consistency. However, guaranteeing the stability of the estimated system matrix is a…
Using the differential precision methods developed previously by the same authors, we study the p-adic stability of standard operations on matrices and vector spaces. We demonstrate that lattice-based methods surpass naive methods in many…
This paper proposes a unified approach for studying global exponential stability of a general class of switched systems described by time-varying nonlinear functional differential equations. Some new delay-independent criteria of global…
In this work we addressed the problem of stability analysis for an uncertain piecewise affine model of a genetic regulatory network. In particular we considered polytopic parameter uncertainties on the proteins production rate functions,…
This report presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra model, provided that the rates in the combined flat model are given. Such a rate lifting is useful for model…
We develop a general stability analysis for objective structures, which constitute a far reaching generalization of crystal lattice systems. We show that these particle systems, although in general neither periodic nor space filling, allow…
We study incremental stability and convergence of switched (bimodal) Filippov systems via contraction analysis. In particular, by using results on regularization of switched dynamical systems, we derive sufficient conditions for convergence…
We make two contributions to the study of polite combination in satisfiability modulo theories. The first contribution is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This…
In a Hilbert space setting, we study the stability properties of the regularized continuous Newton method with two potentials, which aims at solving inclusions governed by structured monotone operators. The Levenberg-Marquardt…