Abstract
Some particular rates of convergence, in the sense of Potra and Pták [4], are related to Newton type iterative methods which solve nonlinear operator equations in Banach spaces. This allows to obtain convergence conditions and a posteriori error estimates at the same time. The applicability of the estimates thus found is studied and their behaviour illustrated by numerical examples.
Zusammenfassung
Es wird ein Verfahren vorgestellt, das zugleich Konvergenzbedingungen und Fehlerschranken bei der Anwendung von Iterationsverfahren der Formx n+1=x n −A(x n)−1 F(x n) zur Lösung nichlinearer GleichungenF(x)=0 in Banachräumen zu bestimmen gestattet. Die Anwendung der Abschätzungen wird besprochen und an numerischen Beispielen erläutert.
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Miel, G. J.: Majorizing sequences and error bounds for iterative methods. Math. Comp.34, 185–202 (1980).
Milne, W. E.: Numerical calculus. Princeton, N. J.: Princeton University Press 1949.
Ortega, J. M., Rheinboldt, W. C.: Iterative solution of nonlinear equations in several variables. New York: Academic Press, 1970.
Potra, F. A., Pták, V.: Sharp error bounds for Newton process. Numer. Math.34, 63–72 (1980).
Rall, L. B.: A note on the convergence of Newton's method. SIAM J. Numer. Anal.11, 34–36 (1974).
Rall, L. B.: A comparison of the existence, theorems of Kantorovich and Moore. SIAM J. Numer. Anal.17, 148–161 (1980).
Rheinboldt, W. C.: A unified convergence theory for a class of iterative processes. SIAM J. Numer. Anal.5, 42–63 (1968).
Traub, J. F., Wozniakowski, H.: Convergence and complexity of Newton iteration for operator equations. J. ACM26, 250–258 (1979).
Zincenko, A. I.: A class of approximate methods for solving operator equations with nondifferentiable operators. Dopovīdí Akad. Nauk Ukraïn. RSR1963, 853–855.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moret, I. A note on Newton type iterative methods. Computing 33, 65–73 (1984). https://doi.org/10.1007/BF02243076
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02243076