Related papers: Polynomial Inequalities and Optimal Stability of N…
A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…
The Lane-Emden inequality controls $\iint_{\mathbb{R}^{2d}}\rho(x)\rho(y)|x-y|^{-\lambda}\,dx\,dy$ in terms of the $L^1$ and $L^p$ norms of $\rho$. We provide a remainder estimate for this inequality in terms of a suitable distance of…
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,…
We consider homogeneous multiaffine polynomials whose coefficients are the Pl\"ucker coordinates of a point $V$ of the Grassmannian. We show that such a polynomial is stable (with respect to the upper half plane) if and only if $V$ is in…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
This paper formalizes connections between stability of polynomials and convergence rates of Markov Chain Monte Carlo (MCMC) algorithms. We prove that if a (multivariate) partition function is nonzero in a region around a real point…
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…
Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…
Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…
In this paper, we investigate the asymptotic behaviors of the solutions of nonlinear dynamic systems nearby an equilibrium point, when the nominal parts are subject to non necessarily small perturbations. We show that, under some estimates…
Polynomial stability of exact solution and modified truncated Euler-Maruyama method for stochastic differential equations with time-dependent delay are investigated in this paper. By using the well known discrete semimartingale convergence…
We investigate analytically and numerically the semi-collisional regime of the plasmoid instability, defined by the inequality $\delta_{SP} \gg \rho_s \gg \delta_{in}$, where $\delta_{SP}$ is the width of a Sweet-Parker current sheet,…
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 stability properties of simple element choices for the mixed formulation of the Laplacian are investigated numerically. The element choices studied use vector Lagrange elements, i.e., the space of continuous piecewise polynomial vector…
Using a new strategy, we extend the classical Nekhoroshev's estimates to the case of H\"older regular steep near-integrable hamiltonian systems, the stability times being polynomially long in the inverse of the size of the perturbation. We…
We study the dynamics of a quantum system having Hilbert space of finite dimension $d_{\mathrm{H}}$. Instabilities are possible provided that the master equation governing the system's dynamics contain nonlinear terms. Here we consider the…
This paper presents original and close to optimal stability conditions linking the time step and the space step, stronger than the CFL criterion: $\delta t\leq C\delta x^\alpha$ with $\alpha=\frac{2r}{2r-1}$, $r$ an integer, for some…
In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers can perform more favorably than their traditional arithmetic equivalents when the latter's precisions are either under- or over-budgeted for…
We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…
We consider a stabilized finite element method based on a spacetime formulation, where the equations are solved on a global (unstructured) spacetime mesh. A unique continuation problem for the wave equation is considered, where data is…