Newton's method for overdetermined systems of equations
Open Access
- 19 May 1999
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 69 (231) , 1099-1116
- https://doi.org/10.1090/s0025-5718-99-01115-1
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.Keywords
This publication has 15 references indexed in Scilit:
- Complexity of Bezout’s Theorem IV: Probability of Success; ExtensionsSIAM Journal on Numerical Analysis, 1996
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTOInternational Journal of Bifurcation and Chaos, 1996
- On generalized Newton algorithms: quadratic convergence, path-following and error analysisTheoretical Computer Science, 1994
- Complexity of Bezout′s TheoremJournal of Complexity, 1993
- Circle fitting by linear and nonlinear least squaresJournal of Optimization Theory and Applications, 1993
- Complexity of Bezout’s Theorem II Volumes and ProbabilitiesPublished by Springer Nature ,1993
- Continuation and path followingActa Numerica, 1993
- Nonlinear RegressionWiley Series in Probability and Statistics, 1989
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex PolynomialsMathematics of Operations Research, 1987
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations.Journal of the American Statistical Association, 1985