A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Advances in Geometry
AbstractGiven a parameterized family of polynomial equations, a fundamental question is to determine upper and lower bounds on the number of real solutions a member of this family can have and, if possible, compute where the bounds are sharp. A computational approach to this problem was developed by Dietmaier in 1998 who used a local linearization procedure to move in the parameter space to change the number of real solutions. He used this approach to show that there exists a Stewart-Goughdoi:10.1515/advgeom-2015-0004 fatcat:whyr3zwxjvdkln6h4xyscc4vpy