Summary
Under proper hypotheses, Rheinboldt has shown that Newtonrelated iterates\(x_{n + 1} = x_n - {\cal D}\left( {x_n } \right)^{ - 1} Fx_n \), where some\({\cal D}\left( x \right)\) approximates the Fréchet derivative of an operatorF, converge to a rootx - ofF. Under these hypotheses, this paper establishes error bounds
whereB n ,C n ,s n are constants, and where ξ n ; are perturbed iterates which take into account rounding errors occuring during actual computations.
Similar content being viewed by others
References
Gragg, W.B., Tapia, R.A.: Optimal error bounds for the Newton-Kantorovich theorem. SIAM J. Numer. Anal.11, 10–13 (1974)
Lancaster, P.: Error analysis for the Newton-Raphson method. Numer. Math.9, 55–68 (1966)
Miel, G.J.: The Kantorovich theorem with optimal error bounds. Amer. Math. Monthly86, 212–215 (1979)
Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. New York: Academic Press 1970
Rockne, J.: Newton's method under mild differentiability conditions with error analysis. Numer. Math.,18, 401–412 (1972)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Miel, G.J. Unified error analysis for Newton-type methods. Numer. Math. 33, 391–396 (1979). https://doi.org/10.1007/BF01399322
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01399322