summary:The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression
AbstractThe evaluation of multivariate polynomials of n variables in Bernstein–Bézier form is consid...
International audiencePolynomial positivity over the real field is known to be decidable but even th...
International audiencePolynomial positivity over the real field is known to be decidable but even th...
summary:The paper presents a simple method to check a positiveness of symmetric multivariate polynom...
summary:The paper presents a simple method to check a positiveness of symmetric multivariate polynom...
AbstractWe propose and study a weighting framework for obtaining bounds on absolute positiveness of ...
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial o...
This paper provides a simple formula for computing such bounds. We also prove that the resulting bou...
Abstract We show that positivity (≥0) on R + n $\mathbb{R}_{+}^{n}$ and on R n $\mathbb{R}^{n}$ of r...
One can read about algorithmic copositivity detection by simplicial partition in a paper of Stefan B...
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial o...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(86/43) / BLDSC - British L...
We propose a characterization of multivariate trigonometric polynomials that are positive on a given...
AbstractA multivariate polynomialP(x1, …,xn) with real coefficients is said to beabsolutely positive...
When dealing with multivariate real polynomials, two natural questions arise : decide if a given pol...
AbstractThe evaluation of multivariate polynomials of n variables in Bernstein–Bézier form is consid...
International audiencePolynomial positivity over the real field is known to be decidable but even th...
International audiencePolynomial positivity over the real field is known to be decidable but even th...
summary:The paper presents a simple method to check a positiveness of symmetric multivariate polynom...
summary:The paper presents a simple method to check a positiveness of symmetric multivariate polynom...
AbstractWe propose and study a weighting framework for obtaining bounds on absolute positiveness of ...
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial o...
This paper provides a simple formula for computing such bounds. We also prove that the resulting bou...
Abstract We show that positivity (≥0) on R + n $\mathbb{R}_{+}^{n}$ and on R n $\mathbb{R}^{n}$ of r...
One can read about algorithmic copositivity detection by simplicial partition in a paper of Stefan B...
This manuscript describes a number of algorithms that can be used to quickly evaluate a polynomial o...
SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(86/43) / BLDSC - British L...
We propose a characterization of multivariate trigonometric polynomials that are positive on a given...
AbstractA multivariate polynomialP(x1, …,xn) with real coefficients is said to beabsolutely positive...
When dealing with multivariate real polynomials, two natural questions arise : decide if a given pol...
AbstractThe evaluation of multivariate polynomials of n variables in Bernstein–Bézier form is consid...
International audiencePolynomial positivity over the real field is known to be decidable but even th...
International audiencePolynomial positivity over the real field is known to be decidable but even th...