Pseudozero Set of Real Multivariate Polynomials

نویسنده

  • Stef Graillat
چکیده

The pseudozero set of a system P of polynomials in n variables is the subset of C consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable sense. This concept arises naturally in Scientific Computing where data often have a limited accuracy. When the polynomials of the system are polynomials with complex coefficients, the pseudozero set has already been studied. In this paper, we focus on the case where the polynomials of the system have real coefficients and such that all the polynomials in all the perturbed polynomial systems have real coefficients as well. We provide an explicit definition to compute this pseudozero set. At last, we analyze different methods to visualize this set. Mathematics Subject Classification (2000). 12D10, 30C10, 30C15, 26C10.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real and complex pseudozero sets for polynomials with applications

Pseudozeros are useful to describe how perturbations of polynomial coefficients affect its zeros. We compare two types of pseudozero sets: the complex and the real pseudozero sets. These sets differ with respect to the type of perturbations. The first set – complex perturbations of a complex polynomial – has been intensively studied while the second one – real perturbations of a real polynomial...

متن کامل

Pseudozeros of multivariate polynomials

The pseudozero set of a system f of polynomials in n complex variables is the subset of C which is the union of the zero-sets of all polynomial systems g that are near to f in a suitable sense. This concept is made precise, and general properties of pseudozero sets are established. In particular it is shown that in many cases of natural interest, the pseudozero set is a semialgebraic set. Also,...

متن کامل

Some topological and geometric properties of pseudozero set

The pseudozero set of a polynomial p is the set of complex numbers that are roots of polynomials which are near to p. This is a powerful tool to analyze the sensitivity of roots with respect to perturbations of the coefficients. Some applications in algebraic computation and robust control theory have been proposed recently. In this paper, we establish some topological and geometric properties ...

متن کامل

Testing polynomial primality with pseudozeros

When polynomials have limited accuracy coefficients or are computed in finite precision, classical algebraic problems such that GCD, primality, divisibility have to be redefined. Such approximate algebraic problems are still challenging open questions in the symbolic computation community. In this paper, we show how a numerical tool, the pseudozero set, may provide solutions to some approximate...

متن کامل

An Approximation to the Gröbner Basis of Ideals of Perturbed Points: Part I

We develop a method for approximating the Gröbner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing phase of the input points to mitigate the effects of the input data uncertainty, and of a new “numerical” version of the Buchberger-Möller algorithm to compute ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics in Computer Science

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2007