Hostname: page-component-84b7d79bbc-c654p Total loading time: 0 Render date: 2024-07-25T22:46:40.833Z Has data issue: false hasContentIssue false

On Newton's method and nondiscrete mathematical induction

Published online by Cambridge University Press:  17 April 2009

Ioannis K. Argyros
Affiliation:
Department of Mathematics, New Mexico State University, Las Cruces, NM. 88003, United States of America
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The method of nondiscrete mathematical induction is used to find sharp error bounds for Newton's method. We assume only that the operator has Hölder continuous derivatives. In the case when the Fréchet-derivative of the operator satisfies a Lipschitz condition, our results reduce to the ones obtained by Ptak and Potra in 1972.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Davis, H.T., Introduction to Nonlinear Differential and Integral Equations (Dover Publ., New York, 1962).Google Scholar
[2]Kantorovich, L.V. and Akilov, G.P., Functional Analysis in Normed Spaces (Pergamon Press, Oxford, 1964).Google Scholar
[3]Potra, F.A. and Ptak, V., Nondiscrete Induction and Iterative Processes (Pitman Publ., 1984).Google Scholar
[4]Potra, F.A. and Ptak, V., ‘Sharp error bounds for Newton's Process’, Numer. Math. 34 (1980), 6372.CrossRefGoogle Scholar
[5]Rheinboldt, W.C., Numerical Analysis of Parametrized Nonlinear Equations (John Wiley, New York, 1986).Google Scholar
[6]Rheinboldt, W.C., ‘A unified convergence theory for a class of iterative processes’, SIAM J. Numer. Anal. 5,1 (1968), 4263.CrossRefGoogle Scholar
[7]Rheinboldt, W.C., Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).Google Scholar