On the feasibility and convergence of the inexact Newton method under minor conditions on the error terms
Abstract
In this paper we introduce a semi-local theorem for the feasibility and convergence of the inexact Newton method, regarding the sequence xk+1 = xk - Df(xk)-1f(xk) + rk, where rk represents the error in each step. Unlike the previous results of this type in the literature, we prove the feasibility of the inexact Newton method under the minor hypothesis that the error rk is bounded by a small constant to be computed, and moreover we prove results concerning the convergence of the sequence xk to the solution under this hypothesis. Moreover, we show how to apply this this method to compute rigorously zeros for two-point boundary value problems of Neumann type. Finally, we apply it to a version of the Cahn-Hilliard equation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.