Newton’s method for overdetermined systems of equations
by
J. P. Dedieu
,
M. Shub
| Venue: | Mathematics of Computation 69 (2000), 1099–1115. MR 2000j:65133 |
| Citations: | 20 - 3 self |
BibTeX
@INPROCEEDINGS{Dedieu_newton’smethod,
author = {J. P. Dedieu and M. Shub},
title = {Newton’s method for overdetermined systems of equations},
booktitle = {Mathematics of Computation 69 (2000), 1099–1115. MR 2000j:65133},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. I.
