Related papers: Real Stability Testing
In this paper, we address stability of parabolic linear Partial Differential Equations (PDEs). We consider PDEs with two spatial variables and spatially dependent polynomial coefficients. We parameterize a class of Lyapunov functionals and…
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable…
Higher-order time integration methods that unconditionally preserve the positivity and linear invariants of the underlying differential equation system cannot belong to the class of general linear methods. This poses a major challenge for…
This paper considers the problem of robust stability for a class of uncertain quantum systems subject to unknown perturbations in the system Hamiltonian. Some general stability results are given for different classes of perturbations to the…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are…
We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax^2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ can be computed in a element-wise mixed stable manner, measured in a relative sense. We also…
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…
The problem of high-dimensional path-dependent optimal stopping (OS) is important to multiple academic communities and applications. Modern OS tasks often have a large number of decision epochs, and complicated non-Markovian dynamics,…
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…
Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of…
A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…
We consider several classes of degenerate hyperbolic equations involving delay terms and suitable nonlinearities. The idea is to rewrite the problems in an abstract way and, using semigroup theory and energy method, we study well posedness…
In this paper we study the stability properties of strongly continuous semigroups generated by block operator matrices. We consider triangular and full operator matrices whose diagonal operator blocks generate polynomially stable…
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
A monotone self-mapping of the nonnegative orthant induces a monotone discrete-time dynamical system which evolves on the same orthant. If with respect to this system the origin is attractive then there must exists points whose image under…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
Many problems in systems and control theory can be formulated in terms of robust D-stability analysis, which aims at verifying if all the eigenvalues of an uncertain matrix lie in a given region D of the complex plane. Robust D-stability…
In this paper, we introduce stable multivariate generalizations of Narayana polynomials of type A and type B. We give an insertion algorithm for labeled plane trees and introduce the notion of improper edges. Our polynomials are…