J. D. Tulay-ayyildiz-akoglu, A. Hauenstein, and . Szanto, Certifying solutions to overdetermined and singular polynomial systems over Q, J. Symbolic Comput, vol.84, pp.147-171, 2018.

D. N. Bernshtein, The number of roots of a system of equations. Functional Analysis and its applications, vol.9, pp.183-185, 1975.

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, 1998.

M. Burr, K. Lee, and A. Leykin, Effective certification of approximate solutions to systems of equations involving analytic functions, Proceedings of the 2019 ACM on International Symposium on Symbolic and Algebraic Computation, pp.267-274, 2019.

J. Dedieu and M. Shub, Newton's method for overdetermined systems of equations, Math. Comp, vol.69, issue.231, pp.1099-1115, 2000.

M. Demazure, Sur deux problemes de reconstruction, INRIA, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075672

P. Deuflhard, Newton methods for nonlinear problems: affine invariance and adaptive algorithms, vol.35, 2011.

W. Fulton, Young tableaux, vol.35, 1997.

W. B. Gragg and R. A. Tapia, Optimal error bounds for the Newton-Kantorovich theorem, SIAM Journal on Numerical Analysis, vol.11, issue.1, pp.10-13, 1974.

R. Daniel, M. E. Grayson, and . Stillman, Macaulay 2, a software system for research in algebraic geometry, 2002.

J. D. Hauenstein, N. Hein, and F. Sottile, A primal-dual formulation for certifiable computations in Schubert calculus, Found. Comput. Math, vol.16, issue.4, pp.941-963, 2016.

J. D. Hauenstein and F. Sottile, Algorithm 921: alphacertified: certifying solutions to polynomial systems, ACM Transactions on Mathematical Software (TOMS), vol.38, issue.4, p.28, 2012.

N. Hein and F. Sottile, A lifted square formulation for certifiable Schubert calculus, J. Symbolic Comput, vol.79, issue.3, pp.594-608, 2017.

L. Vitalevich-kantorovich and G. Pavlovich-akilov, Functional analysis. Pergamon, 1982.

D. Kapur and K. Madlener, A completion procedure for computing a canonical basis for a k-subalgebra, Computers and mathematics, pp.1-11, 1989.

K. Kaveh and C. Manon, Khovanskii bases, higher rank valuations and tropical geometry, SIAM J. Appl. Algebra Geometry, vol.3, issue.2, pp.292-336, 2019.

K. Kaveh and A. Khovanskii, Mixed volume and an extension of intersection theory of divisors, Moscow Mathematical Journal, vol.10, issue.2, pp.343-375, 2010.

K. Kaveh and A. Khovanskii, Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory, Annals of Mathematics, pp.925-978, 2012.

L. Steven and . Kleiman, The transversality of a general translate, Compositio Math, vol.28, pp.287-297, 1974.

J. O. Kleppe, J. C. Migliore, R. Miró-roig, U. Nagel, and C. Peterson, Gorenstein liaison, complete intersection liaison invariants and unobstructedness, Mem. Amer. Math. Soc, vol.154, issue.732, p.116, 2001.

R. Krawczyk, Newton-algorithmen zur bestimmung von nullstellen mit fehler-schranken, Computing, vol.4, issue.3, pp.187-201, 1969.

W. Ulrich, W. L. Kulisch, and . Miranker, Computer arithmetic in theory and practice, 2014.

A. G. Ku?nirenko, Newton polyhedra and Bezout's theorem, Funkcional. Anal. i Prilo?en, vol.10, issue.3, pp.82-83, 1976.

G. Lecerf and J. Saadé, A short survey on Kantorovich-like theorems for Newton's method, ACM Commun. Comput. Algebra, vol.50, issue.1, pp.1-11, 2016.

K. Lee, NumericalCertification: A Macaulay2 package

A. Leykin, NAG4M2: Numerical algebraic geometry for Macaulay2. available at people.math

A. Leykin, A. Martin-del-campo, F. Sottile, R. Vakil, and J. Verschelde, Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm, 2018.

R. E. Moore and S. T. Jones, Safe starting regions for iterative methods, SIAM Journal on Numerical Analysis, vol.14, issue.6, pp.1051-1065, 1977.

R. E. Moore, R. Baker, M. J. Kearfott, and . Cloud, Introduction to interval analysis, vol.110, 2009.

D. Nistér, An efficient solution to the five-point relative pose problem, vol.26, pp.756-777, 2004.

L. Robbiano and M. Sweedler, Subalgebra bases, Commutative algebra, pp.61-87, 1990.

F. Rouillier, Solving zero-dimensional systems through the rational univariate representation, Appl. Algebra Engrg. Comm. Comput, vol.9, issue.5, pp.433-461, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00073264

D. Shannon and M. Sweedler, Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence, Journal of Symbolic Computation, vol.6, issue.2-3, pp.267-273, 1988.

M. Shub and S. Smale, Complexity of Bezout's theorem I: Geometric aspects, Journal of the American Mathematical Society, vol.6, issue.2, pp.459-501, 1993.

S. Smale, Newton's method estimates from data at one point, The merging of disciplines: new directions in pure, applied, and computational mathematics, pp.185-196, 1986.

N. Snavely, S. M. Seitz, and R. Szeliski, Modeling the world from internet photo collections, International journal of computer vision, vol.80, issue.2, pp.189-210, 2008.

F. Sottile, Enumerative geometry for the real Grassmannian of lines in projective space, Duke Math. J, vol.87, issue.1, pp.59-85, 1997.

M. Stillman and H. Tsai, Using SAGBI bases to compute invariants, Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.285-302, 1999.

B. Sturmfels, Gröbner bases and convex polytopes, vol.8, 1996.

R. A. Tapia, The Kantorovich Theorem for Newton's Method, Amer. Math. Monthly, vol.78, issue.4, pp.389-392, 1971.

W. Tucker, Validated numerics: a short introduction to rigorous computations, 2011.

C. Wampler and A. Sommese, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, 2005.