Related papers: Polynomial Inequalities and Optimal Stability of N…
To understand the empirical success of approximate MAP inference, recent work (Lang et al., 2018) has shown that some popular approximation algorithms perform very well when the input instance is stable. The simplest stability condition…
To predict allowable time-step size for the fully discretized nonlinear differential equations, a stability theory is developed using exact determination of an infinite perturbation series. Mathematical induction is used to determine the…
For interval polynomial matrices, we identify the minimal testing set, whose stability can guarantee that of the whole uncertain set. Our results improve the conclusions given by Kamal and Dahleh.
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…
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…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
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…
The leading-order approximation to a Filippov system $f$ about a generic boundary equilibrium $x^*$ is a system $F$ that is affine one side of the boundary and constant on the other side. We prove $x^*$ is exponentially stable for $f$ if…
In recent decades, there have been many attempts to construct symplectic integrators with variable time steps, with rather disappointing results. In this paper we identify the causes for this lack of performance, and find that they fall…
We describe immanants as trivial modules of the symmetric group and show that any homogeneous polynomial of degree n on the space of n by n matrices preserved up to scalar by left and right action by diagonal matrices and conjugation by…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous…
A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…
This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…
For a complex polynomial \[ f\left( s\right) =s^{n}+a_{n-1}s^{n-1}+\ldots+a_{1}s+a_{0}% \] and for a rational number $p$, we consider the Schur stability problem of the $p$-th Hadamard power of $f$ \[ f^{\left[ p\right] }\left( s\right)…
Mapping class groups satisfy cohomological stability. In this note we show how results by Bestvina and Fujiwara imply that the bounded cohomology does not stabilize, additionally we show that stabily polynomials in the Mumford-Morita-Miller…
Let $G$ be a graph and suppose we are given, for each $v \in V(G)$, a strict ordering of the neighbors of $v$. A set of matchings ${\cal M}$ of $G$ is called internally stable if there are no matchings $M,M' \in {\cal M}$ such that an edge…
The stability of integrators dealing with high order Differential Algebraic Equations (DAEs) is a major issue. The usual procedures give rise to instabilities that are not predicted by the usual linear analysis, rendering the common checks…
We define an algebra $A$ to be centrally stable if, for every epimorhism $\varphi$ from $A$ to another algebra $B$, the center $Z(B)$ of $B$ is equal to $\varphi(Z(A))$, the image of the center of $A$. After providing some examples and…
We call a multivariable polynomial an Agler denominator if it is the denominator of a rational inner function in the Schur-Agler class, an important subclass of the bounded analytic functions on the polydisk. We give a necessary and…