Related papers: Positivstellens\"atze for polynomial matrices with…
In this expository paper, we present simple proofs of the Classical, Real, Projective and Combinatorial Nullstellens\"atze. Several applications are also presented such as a classical theorem of Stickelberger for solutions of polynomial…
Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…
We deal with and investigate sparse univariate Positivstellens\"atze, Nichtnegativstellens\"atze, and solutions to sparse moment problems. The paper relies heavily on results on T-system by Karlin in 1963 and by Karlin and Studden in 1966.…
We present bounds for the sparseness and for the degrees of the polynomials in the Nullstellensatz. Our bounds depend mainly on the unmixed volume of the input polynomial system. The degree bounds can substantially improve the known ones…
A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellens\"atze (Ps\"atze) guarantee the existence of NNCs. Both, NNCs and Ps\"atze underlie powerful…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
Assume that $A_{1},...,A_{s}$ are complex $n\times n$ matrices. We give a computable criterion for existence of a common eigenvector of $A_{i}$ which generalize the result of D. Shemesh established for two matrices. We use this criterion to…
We consider the problem of finding the global optimum of a real-valued complex polynomial on a compact set defined by real-valued complex polynomial inequalities. It reduces to solving a sequence of complex semidefinite programming…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
We study an elementary inequality supporting the classical Hermite-Hadamard inequality in the matrix setting. This leads to a number of interesting matrix inequalities such new Schatten p-norm estimates and new majorization
This paper introduces a fully algebraic two-level additive Schwarz preconditioner for general sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite (SPD) matrices. For those matrices, the coarse space…
In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz…
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
We extend previous results about Putinar's Positivstellensatz for cylinders of type $S \times {\mathbb R}$ to sets of type $S \times {\mathbb R}^r$ in some special cases taking into account $r$ and the degree of the polynomial with respect…
In this paper we give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar…
The Positivstellens\"atze of Putinar and Schm\"udgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of…
Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…
We prove Bernstein-type matrix concentration inequalities for linear combinations with matrix coefficients of binary random variables satisfying certain $\ell_\infty$-independence assumptions, complementing recent results by Kaufman, Kyng…
P\'olya's Positivstellensatz on the $1$-simplex says that if $P(x)$ is a real polynomial such that $P(x)>0$ whenever $x \ge 0$, then all the coefficients of $(1+x)^mP(x)$ are positive whenever $m$ is large. Powers-Reznick gave a complexity…