Page 1

Displaying 1 – 12 of 12

Showing per page

A fast numerical test of multivariate polynomial positiveness with applications

Petr Augusta, Petra Augustová (2018)

Kybernetika

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.

A generalization of the Gauss-Lucas theorem

J. L. Díaz-Barrero, J. J. Egozcue (2008)

Czechoslovak Mathematical Journal

Given a set of points in the complex plane, an incomplete polynomial is defined as the one which has these points as zeros except one of them. The classical result known as Gauss-Lucas theorem on the location of zeros of polynomials and their derivatives is extended to convex linear combinations of incomplete polynomials. An integral representation of convex linear combinations of incomplete polynomials is also given.

Currently displaying 1 – 12 of 12

Page 1