Related papers: Lifted polytope methods for stability analysis of …
This work primarily focuses on an operator inference methodology aimed at constructing low-dimensional dynamical models based on a priori hypotheses about their structure, often informed by established physics or expert insights. Stability…
Entropy notions for $\varepsilon$-incremental practical stability and incremental stability of deterministic nonlinear systems under disturbances are introduced. The entropy notions are constructed via a set of points in state space which…
We present a new class of particle methods with deformable shapes that converge in the uniform norm without requiring remappings, extended overlapping or vanishing moments for the particles. The crux of the method is to use polynomial…
Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and…
The linear switching system is a system of ODE with the time-dependent matrix taking values from a given control matrix set. The system is (asymptotically) stable if all its trajectories tend to zero for every control function. We consider…
We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d…
This paper investigates the stability and stabilization of diffusively coupled network dynamical systems. We leverage Lyapunov methods to analyze the role of coupling in stabilizing or destabilizing network systems. We derive critical…
This note presents a numerical example worked out in order to illustrate the solution to the output regulation problem with quadratic stability for linear switching systems derived in [1].
In this work, we address the problem of finite-time stabilization for a class of bilinear system. We propose a decomposition-based approach in which the nominal system is split into two subsystems, one of which is inherently finite-time…
When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-standard starting point for the iteration. This paper presents…
The paper is concerned with asymptotic stability properties of linear switched systems. Under the hypothesis that all the subsystems share a non strict quadratic Lyapunov function, we provide a large class of switching signals for which a…
We propose an algorithm to restrict the switching signals of a constrained switched system in order to guarantee its stability, while at the same time attempting to keep the largest possible set of allowed switching signals. Our work is…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…
Many nonlinear dynamical systems can be written as Lure systems, which are described by a linear time-invariant system interconnected with a diagonal static sector-bounded nonlinearity. Sufficient conditions are derived for the global…
One of the main aspects of switched affine systems that makes their stabilizability study intricate is the existence of (generally) infinitely many equilibrium points in the state space. Thus, prior to designing the switched control, the…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
We consider the problem of counting (stable) equilibriums of an important family of algebraic differential equations modeling multistable biological regulatory systems. The problem can be solved, in principle, using real quantifier…
In this paper, we derive a practical, general framework for creating adaptive iterative (linearization or splitting) algorithms to solve multi-physics problems. This means that, given an iterative method, we derive \textit{a posteriori}…
We introduce a novel concept of simple loop dwell time and use it to give sufficient conditions for stability of a continuous-time linear switched system where switching between subsystems is governed by an underlying graph. We present a…