S. Dennis, S. Arnon, and . Mccallum, A polynomial-time algorithm for the topological type of a real algebraic curve, J. Symbolic Comput, vol.5, issue.12, pp.213-236, 1988.

B. Beckermann and G. Labahn, When are Two Numerical Polynomials Relatively Prime?, Journal of Symbolic Computation, vol.26, issue.6, pp.677-689, 1998.
DOI : 10.1006/jsco.1998.0234
URL : http://doi.org/10.1006/jsco.1998.0234

A. Dario, P. Bini, and . Boito, Structured matrix-based methods for polynomial -gcd: analysis and comparisons, ISSAC 2007, pp.9-16, 2007.

L. Blum, F. Cucker, M. Shub, and S. Smale, COMPLEXITY AND REAL COMPUTATION: A MANIFESTO, International Journal of Bifurcation and Chaos, vol.06, issue.01, pp.3-26, 1996.
DOI : 10.1142/S0218127496001818

W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM, vol.18, issue.4, pp.478-504, 1971.
DOI : 10.1145/321662.321664

G. Chèze, J. Yakoubsohn, A. Galligo, and B. Mourrain, Computing nearest Gcd with certification, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, pp.29-34, 2009.
DOI : 10.1145/1577190.1577200

R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Watt, The singular value decomposition for polynomial systems, Proceedings of the 1995 international symposium on Symbolic and algebraic computation , ISSAC '95, pp.195-207, 1995.
DOI : 10.1145/220346.220371

J. P. Dedieu, X. Gourdon, and J. C. Yakoubsohn, Computing the distance from a point to an algebraic hypersurface In The mathematics of numerical analysis, Lectures in Appl. Math, vol.32, pp.285-293, 1995.

I. Z. Emiris, A. Galligo, and H. Lombardi, Certified approximate univariate GCDs, Journal of Pure and Applied Algebra, vol.117, issue.118, pp.229-251, 1997.
DOI : 10.1016/S0022-4049(97)00013-3

M. Giusti, G. Lecerf, B. Salvy, and J. Yakoubsohn, On Location and Approximation of Clusters of Zeros of Analytic Functions, Foundations of Computational Mathematics, vol.5, issue.3, pp.257-311, 2005.
DOI : 10.1007/s10208-004-0144-z
URL : https://hal.archives-ouvertes.fr/hal-00186736

V. Hribernig and H. J. Stetter, Detection and Validation of Clusters of Polynomial Zeros, Journal of Symbolic Computation, vol.24, issue.6, pp.667-681, 1997.
DOI : 10.1006/jsco.1997.0160

E. Kaltofen, Z. Yang, and L. Zhi, Structured Low Rank Approximation of a Sylvester Matrix, Symbolic-numeric computation, Trends Math, pp.69-83, 2007.
DOI : 10.1007/978-3-7643-7984-1_5

N. K. Karmarkar and Y. N. Lakshman, On Approximate GCDs of Univariate Polynomials, Journal of Symbolic Computation, vol.26, issue.6, pp.653-666, 1998.
DOI : 10.1006/jsco.1998.0232

D. Manocha and J. Demmel, Algorithms for intersecting parametric and algebraic curves I: simple intersections, ACM Transactions on Graphics, vol.13, issue.1, pp.73-100, 1994.
DOI : 10.1145/174462.174617

Y. Nesterov and A. Nemirovskii, Interior-point polynomial algorithms in convex programming, SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), vol.13, 1994.
DOI : 10.1137/1.9781611970791

J. Nie, J. Demmel, and M. Gu, Global minimization of rational functions and the nearest GCDs, Journal of Global Optimization, vol.11, issue.12, pp.697-718, 2008.
DOI : 10.1007/s10898-006-9119-8

. Matu-tarow, T. Noda, and . Sasaki, Approximate GCD and its application to illconditioned algebraic equations, Proceedings of the International Symposium on Computational Mathematics, pp.335-351, 1990.

Y. Victor and . Pan, Computation of approximate polynomial GCDs and an extension, Inform. and Comput, vol.167, issue.2, pp.71-85, 2001.

D. Rupprecht, Eléments de Géométrie Algébrique Approchée: ´ etude du PGCD et de la factorisation, 2000.

A. Schönhage, Quasi-GCD computations, Journal of Complexity, vol.1, issue.1, pp.118-137, 1985.
DOI : 10.1016/0885-064X(85)90024-X

M. Shub and S. Smale, Complexity of Bézout's theorem. I. Geometric aspects, J. Amer. Math. Soc, vol.6, issue.2, pp.459-501, 1993.

A. Terui, An iterative method for calculating approximate GCD of univariate polynomials, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.351-358, 2009.
DOI : 10.1145/1576702.1576750

K. Tanabe, A geometric method in nonlinear programming, Journal of Optimization Theory and Applications, vol.10, issue.2, pp.181-210, 1980.
DOI : 10.1007/BF00934495