相关论文: Stability Testing of Matrix Polytopes

Exponential stability and solution estimates are investigated for a delay system $$ \dot{x}(t) - A(t)\dot{x}(g(t))=\sum_{k=1}^m B_k(t)x(h_k(t)) $$ of a neutral type, where $A$ and $B_k$ are $n\times n$ bounded matrix functions, and $g, h_k$…

The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…

This work investigates the hardness of computing sparse solutions to systems of linear equations over F_2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F_2 on n variables, decide if there exists a…

We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more…

Deep learning (DL) has had unprecedented success and is now entering scientific computing with full force. However, current DL methods typically suffer from instability, even when universal approximation properties guarantee the existence…

We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…

It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…

We treat the 1D shock tube problem, establishing existence of steady solutions of full (nonisentropic) polytropic gas dynamics with arbitrary noncharacteristic data. We present also numerical experiments indicating uniqueness and…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

We will address the problem of determining the existence and asymptotic stability of a non-trivial periodic orbit in dynamical systems described by polynomial vector fields. To this end, we will lean upon the celebrated results of Borg,…

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

We study the following optimization problem over a dynamical system that consists of several linear subsystems: Given a finite set of $n\times n$ matrices and an $n$-dimensional vector, find a sequence of $K$ matrices, each chosen from the…

We study \emph{multiplicity equivalence} testing of automata over partially commutative monoids (pc monoids) and show efficient algorithms in special cases, exploiting the structure of the underlying non-commutation graph of the monoid.…

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We describe new methods for deciding the stability of switching systems. The methods build on two ideas previously appeared in the literature: the polytope norm iterative construction, and the lifting procedure. Moreover, the combination of…

In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…

We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…

Neural networks have become increasingly popular in controller design due to their versatility and efficiency. However, their integration into feedback systems can pose stability challenges, particularly in the presence of uncertainties.…