Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Newton's method for overdetermined
systems of equations


Authors: J. P. Dedieu and M. Shub
Journal: Math. Comp. 69 (2000), 1099-1115
MSC (1991): Primary 65, 15
Published electronically: May 19, 1999
MathSciNet review: 1651750
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation of the American Mathematical Society with MSC (1991): 65, 15

Retrieve articles in all journals with MSC (1991): 65, 15


Additional Information

J. P. Dedieu
Affiliation: LAO, Université Paul Sabatier, 31062 Toulouse, Cedex 04, France
Email: dedieu@cict.fr

M. Shub
Affiliation: Department of Mathematical Sciences, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY 10598
Email: mshub@us.ibm.com

DOI: http://dx.doi.org/10.1090/S0025-5718-99-01115-1
PII: S 0025-5718(99)01115-1
Received by editor(s): February 19, 1998
Received by editor(s) in revised form: August 17, 1998
Published electronically: May 19, 1999
Additional Notes: The second author was partially supported by an NSF grant
Article copyright: © Copyright 2000 American Mathematical Society