Newton's method for overdetermined systems of equations

Abstract. Complexity theoretic aspects of continuation methods for the solution of square or underdetermined systems of polynomial equations have been studied by various authors. In this paper we consider overdetermined systems where there are more equations than unknowns. We study Newton's method for such a system.

• Type: Journal
• Year: 2000
• Where: MOC
• Authors: Jean-Pierre Dedieu, Mike Shub
• Keywords: Complexity Theoretic Aspects, MOC 2000, Polynomial Equations, Various Authors