相关论文: Robust SPR Synthesis for Low-Order Polynomial Segm…

Little seems to be known about the invariant manifolds for stochastic partial differential equations (SPDEs) driven by nonlinear multiplicative noise. Here we contribute to this aspect and analyze the Lu-Schmalfu{\ss} conjecture…

For any two $n$-$th$ order polynomials $a(s)$ and $b(s),$ the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial $c(s)$ such that $c(s)/a(s)$ and $c(s)/b(s)$ are both strictly…

We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

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…

For the two sixth-order polynomials $a(s)$ and $b(s),$ Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial $c(s)$ such that $c(s)/a(s)$ and $c(s)/b(s)$ are both strictly positive real.…

For the left-sector stability of interval polynomials, it suffices to check a subset of its vertex polynomials. This paper provides a recipe for construction of these critical vertices. Illustrative examples are presented.

A criterion on the asymptotic stability of fractional-order systems with incomensurate orders is proposed in this paper. Existing methods always assume order parameters be rational numbers or the ratios of any two orders be rational…

Let $\operatorname{Con}(\mathbf T)\!\restriction\!x$ denote the finite consistency statement "there are no proofs of contradiction in $\mathbf T$ with $\leq x$ symbols". For a large class of natural theories $\mathbf T$, Pudl\'ak has shown…

In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…

For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…

We consider the stability of high-order Scott-Vogelius elements for 2D non-Newtonian incompressible flow problems. For elements of degree 4 or higher, we construct a right-inverse of the divergence operator that is stable uniformly in 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.

Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

We provide a partially affirmative answer to the following question on robustness of polynomial stability with respect to sampling: ``Suppose that a continuous-time state-feedback controller achieves the polynomial stability of the…

We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our…

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…