Learn More
In this paper we apply for the rst time a new method for multivariate equation solving which was developed in 18], 19], 20] for complex root determination to the real case. Our main result concerns the problem of nding at least one representative point for each connected component of a real compact and smooth hypersurface. The basic algorithm of 18], 19],(More)
The objective of this paper is to show how the recently proposed method by Giusti, Heintz, Morais, Morgenstern, Pardo [10] can be applied to a case of real polynomial equation solving. Our main result concerns the problem of finding one representative point for each connected component of a real bounded smooth hypersurface. The algorithm in [10] yields a(More)
The objective of this paper is to show how the recently proposed method by Giusti, Heintz, Morais, Morgenstern, Pardo 10] can be applied to a case of real polynomial equation solving. Our main result concerns the problem of nding one representative point for each connected component of a real bounded smooth hypersurface. The algorithm in 10] yields a method(More)
Let V 0 be a smooth and compact real variety given by a reduced regular sequence of polynomials f 1 : : : : f p. This paper is devoted to the algorithmic problem of nding eeciently for each connected component o f V 0 a representative point. For this purpose we exhibit explicit polynomial equations which describe for generic variables the polar varieties of(More)
In this paper we apply for the rst time a new method for multivariate equation solving which was developed in 18], 19], 20] for complex root determination to the real case. Our main result concerns the problem of nding at least one representative point f o r e a c h connected component of a real compact and smooth hypersurface. The basic algorithm of 18],(More)
  • 1