Pseudozeros of multivariate polynomials
Document Type
Article
Publication Date
4-1-2003
Abstract
The pseudozero set of a system f of polynomials in n complex variables is the subset of Cn 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, estimates are given for the size of the projections of pseudozero sets in coordinate directions. Several examples are presented illustrating some of the general theory developed here. Finally, algorithmic ideas are proposed for solving multivariate polynomials.
Publication Source (Journal or Book title)
Mathematics of Computation
First Page
975
Last Page
1002
Recommended Citation
William Hoffman, J., Madden, J., & Zhang, H. (2003). Pseudozeros of multivariate polynomials. Mathematics of Computation, 72 (242), 975-1002. https://doi.org/10.1090/S0025-5718-02-01429-1