Related papers: Polynomial Inequalities and Optimal Stability of N…
This paper proposes a framework to assess the stability of an ordinary differential equation which is coupled to a 1D-partial differential equation (PDE). The stability theorem is based on a new result on Integral Quadratic Constraints…
We study the stability of explicit one-step integration schemes for the linear finite element approximation of linear parabolic equations. The derived bound on the largest permissible time step is tight for any mesh and any diffusion matrix…
In this paper, we study the stability of the concentration inequality for one-dimensional complex polynomials. We provide the stability of the local concentration inequality and a global version using a Wehrl-type entropy.
This paper proposes a simple strategy to simulate stochastic differential equations (SDE) arising in constant temperature molecular dynamics. The main idea is to patch an explicit integrator with Metropolis accept or reject steps. The…
The analytic form of a new class of factorized Runge-Kutta-Chebyshev (FRKC) stability polynomials of arbitrary order $N$ is presented. Roots of FRKC stability polynomials of degree $L=MN$ are used to construct explicit schemes comprising…
We prove two general results concerning spectral sequences of $\mathbf{FI}$-modules. These results can be used to significantly improve stable ranges in a large portion of the stability theorems for $\mathbf{FI}$-modules currently in the…
We propose a novel discrete Poisson equation approach to estimate the statistical error of a broad class of numerical integrators for the underdamped Langevin dynamics. The statistical error refers to the mean square error of the estimator…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on…
We introduce the notions of semi-uniform input-to-state stability and its subclass, polynomial input-to-state stability, for infinite-dimensional systems. We establish a characterization of semi-uniform input-to-state stability based on…
We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…
A multivariate polynomial is {\em stable} if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra $\A_n$ that preserve stability. An important…
We consider the Gel'fand inverse problem and continue studies of [Mandache,2001]. We show that the Mandache-type instability remains valid even in the case of Dirichlet-to-Neumann map given on the energy intervals. These instability results…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
Many statistical estimators are defined as the fixed point of a data-dependent operator, with estimators based on minimizing a cost function being an important special case. The limiting performance of such estimators depends on the…
In present paper, an analysis of the stability behaviour of ideal efficient solutions to parametric vector optimization problems is conducted. A sufficient condition for the existence of ideal efficient solutions to locally perturbed…
We investigate the notion of stability proposed by Bilu and Linial. We obtain an exact polynomial-time algorithm for $\gamma$-stable Max Cut instances with $\gamma \geq c\sqrt{\log n}\log\log n$ for some absolute constant $c > 0$. Our…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natural iterative algorithm until a fixed point is reached.…