Abstract
In the presence of rounding errors the sequence of iterates generated by a Newton-like method implemented on a computer differs from the generated sequence produced in theory. We give conditions for the convergence of the generated sequence to an isolated solution of the equation F(x) = 0 and show that these conditions are violated in a neighbourhood of the solution. The relative accuracy to which one can expect to estimate the solution is shown to depend largely on the accuracy to which the mapping F is evaluated.

This publication has 0 references indexed in Scilit: