Error bounds for Newton's iterates derived from the ...
link.springer.com › article › 10In this paper, it is shown that the upper and lower bounds of the errors in the Newton iterates recently obtained by Potra-Pták [11] and Miel [7], with the use of nondiscrete induction and majorizing sequence, respectively, follow immediately from the Kantorovich theorem and the Kantorovich recurrence relations. It is also shown that the upper and lower bounds of Miel are finer than those of ...
A method for finding sharp error bounds for Newton's method ...
link.springer.com › article › 10This paper gives a method for finding sharp a posteriori error bounds for Newton's method under the assumptions of Kantorovich's theorem. On the basis of this method, new error bounds are derived, and comparison is made among the known bounds of Dennis [2], Döring [4], Gragg-Tapia [5], Kantorovich [6, 7], Kornstaedt [9], Lancaster [10], Miel [11–13], Moret [14], Ostrowski [17, 18], Potra [19], and Potra-Pták [20].