Manoj Kumar Singh

We develop the local convergence of the six order Contraharmonic-mean Newton’s method (CHN) to solve Banach space valued equations. Our analysis approach is two fold: The first way uses Taylor’s series and derivatives of higher orders. The second one uses only the first derivatives. We examine the theoretical results by solving a boundary value problem also using the examples relating the proposed method with other’s methods such as Newton’s, Kou’s and Jarratt’s to show that the proposed method performs better. The conjugate maps for second-degree polynomial are verified. We also calculate the fixed points (extraneous). The article is completed with the study of basins of attraction, which support and further validate the theoretical and numerical results.

We carried out a local comparison between two ninth convergence order schemes for solving nonlinear equations, relying on first-order Fréchet derivatives. Earlier investigations require the existence as well as the boundedness of derivatives of a high order to prove the convergence of these schemes. However, these derivatives are not in the schemes. These assumptions restrict the applicability of the schemes, which may converge. Numerical results along with a boundary value problem are given to examine the theoretical results. Both schemes are symmetrical not only in the theoretical results (formation and convergence order), but the numerical and dynamical results are also similar. We calculated the convergence radii of the nonlinear schemes. Moreover, we obtained the extraneous fixed points for the proposed schemes, which are repulsive and are not part of the solution space. Lastly, the theoretical and numerical results are supported by the dynamic results, where we plotted basins of attraction for a selected test function.

In the present paper, we introduced a quadratically convergent Newton’s like normal S2 iteration method free from the second derivative for the solution of nonlinear equations permitting 3 f'(x) = 0 at some points in the neighborhood of the root. Our proposed method works well 4 when the Newton method fails. Numerically it has been verified that the Newton’s like normal 5 S-iteration method converges faster than Fang et al. method [A cubically convergent Newton-type 6 method under weak conditions, J. Compute. and Appl. Math., 220 (2008), 409-412]. We studied 7 different aspects of normal S-iteration method. Lastly, fractal patterns support the numerical 8 results and explain the convergence, divergence, and stability of method.

The objective of the current work is to invent and introduce the continuous version of Newton’s method. This scheme is used to establish some interesting properties with examples. We have plotted the fractal pattern graphs for a Newton-like method and a Damped Newton-like method in the discrete case and hence we have introduced a new concept of streamline for the continuous version of the Newton-like method. The graph and streamlines of these patterns are in agreement with numerical results and describe the convergence and stability of the proposed method to different roots when the Newton method fails.