Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4630305 | Applied Mathematics and Computation | 2011 | 14 Pages |
Abstract
Iterative methods, such as Newton's, behave poorly when solving ill-conditioned problems: they become slow (first order), and decrease their accuracy. In this paper we analyze deeply and widely the convergence of a modified Newton method, which we call perturbed Newton, in order to overcome the usual disadvantages Newton's one presents. The basic point of this method is the dependence of a parameter affording a degree of freedom that introduces regularization. Choices for that parameter are proposed. The theoretical analysis will be illustrated through examples.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
R. Peris, A. Marquina, V. Candela,