相关论文: Repr\'esentations d\'eterminantales effectives des…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

In this paper we explore determinantal representations of multiaffine polynomials and consequences for the image of various spaces of matrices under the principal minor map. We show that a real multiaffine polynomial has a definite…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

We show that for every smooth hyperbolic polynomial h there is another hyperbolic polynomial q such that qh has a definite determinantal representation. This is proved by considering sum-of-squares decompositions of certain bilinear forms…

We consider real polynomials in one variable without vanishing coefficients and with all roots real and of distinct moduli. We show that the signs of the coefficients define the order of the moduli of the roots on the real positive…

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

We show that for a multivariable polynomial $p(z)=p(z_1, \ldots , z_d)$ with a determinantal representation $$ p(z) = p(0) \det (I_n- K (\oplus_{j=1}^d z_j I_{n_j}))$$ the matrix $K$ is structurally similar to a strictly $J$-contractive…