相关论文: Stability Testing of Matrix Polytopes

Can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories? We tackle this black-box problem for switched linear systems. We show that, for any given random set of…

It has been the standard teaching of today that backward stability analysis is taught as absolute, just as in Newtonian physics time is taught absolute time. We will prove it is not true in general. It depends on algorithms. We will prove…

The focal point of this paper is to provide some simple and efficient criteria to judge the ${\cal D}$-stability of two families of polynomials, i.e., an interval multilinear polynomial matrix family and a polytopic polynomial family.…

We prove that strong structural controllability of a pair of structural matrices $(\mathcal{A},\mathcal{B})$ can be verified in time linear in $n + r + \nu$, where $\mathcal{A}$ is square, $n$ and $r$ denote the number of columns of…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

We define a variant of k-of-n testing that we call conservative k-of-n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative k-of-n testing, in a parallel setting. This…

In this work the stability of perturbed linear time-varying systems is studied. The main features of the problem are threefold. Firstly, the time-varying dynamics is not required to be continuous but allowed to have jumps. Also the system…

For given non-consistent initial conditions, we study the stability of a class of generalised linear systems of difference equations with constant coefficients and taking into account that the leading coefficient can be a singular matrix.…

We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Given a convex set $Q \subseteq R^m$ and an integer matrix $W \in Z^{m \times n}$, we consider statements of the form $ \forall b \in Q \cap Z^m$ $\exists x \in Z^n$ s.t. $Wx \leq b$. Such statements can be verified in polynomial time with…

In this paper, we consider the following inverse maintenance problem: given $A \in \mathbb{R}^{n\times d}$ and a number of rounds $r$, we receive a $n\times n$ diagonal matrix $D^{(k)}$ at round $k$ and we wish to maintain an efficient…

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

We propose a principled method for projecting an arbitrary square matrix to the non-convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

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…

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

One of the fundamental open problems in control theory is that of the stabilization of a linear time invariant dynamical system through static output feedback. We are given a linear dynamical system defined through \begin{align*} \mydot{w}…

This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…