You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Comparison of Different Bounding Sets of Polynomial Functions Defined in a Given Domain
Bulletin mathématique de la Société des Sciences Mathématiques de Roumanie
Nouvelle Série, Vol. 54 (102), No. 2 (2011), pp. 185-191
Published by: Societatea de Științe Matematice din România
Stable URL: http://www.jstor.org/stable/43679412
Page Count: 7
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Subdivision and subdivision/iterative hybrid methods for solving a system of polynomial equations require the ability to compute the bounding set of a polynomial function for a given domain. There are different methods to compute the bounding sets and each method produces different bounding sets. Since the sizes of these bounding sets directly affect the running time of subdivision and hybrid methods, selecting the appropriate method for computing bounding sets is important. This article investigates three methods for computing bounding sets and compares them experimentally to see which one produces the smallest sets. The results show that reparametrization followed by constructing convex hulls of the control points of the resulting polynomials in Bernstein basis almost always produces smaller bounding sets than the other two methods. Therefore, using this method to compute bounding sets would result in more efficient subdivision or hybrid methods for solving polynomial systems.
Bulletin mathématique de la Société des Sciences Mathématiques de Roumanie © 2011 Societatea de Științe Matematice din România