
We provide a semilocal analysis of the Newton-Kurchatov method for solving nonlinear equations involving a splitting of an operator. Iterative methods have a limited restricted region in general. A convergence of this method is presented under classical Lipschitz conditions.The novelty of our paper lies in the fact that we obtain weaker sufficient semilocal convergence criteria and tighter error estimates than in earlier works. We find a more precise location than before where the iterates lie resulting to at least as small Lipschitz constants. Moreover, no additional computations are needed than before. Finally, we give results of numerical experiments.
nonlinear equation; newton-kurchatov method; semilocal convergence; decomposition of operator, Iterative procedures involving nonlinear operators, Numerical solutions to equations with nonlinear operators, semilocal convergence, QA1-939, Newton-Kurchatov method, nonlinear equation, Mathematics, decomposition of operator
nonlinear equation; newton-kurchatov method; semilocal convergence; decomposition of operator, Iterative procedures involving nonlinear operators, Numerical solutions to equations with nonlinear operators, semilocal convergence, QA1-939, Newton-Kurchatov method, nonlinear equation, Mathematics, decomposition of operator
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
