In this paper, Kou's method is extended to solve nonlinear systems. The convergence order of the iterative method is proved. Using fractal theory, we study the theoretical operators related to the iterative method, and analyze the stability of the iterative method. Properties related to strange fixed points and critical points are explored. The fractal results indicate that the iterative method is most stable when the parameter $\gamma$ equals zero. The extended iterative method is applied to solve the Hammerstein equation and some nonlinear systems. The dynamic plane and numerical experiments show that the extended iterative method can solve the nonlinear system of equations with good convergence and stability.

In this paper, the local convergence of a high-order Chebyshev-type method without the second derivative is studied. We study the convergence under $\omega$-continuity conditions based on the first derivative. The uniqueness of the solution and the radii of convergence domains are obtained. In contrast to the conditions used in previous studies, the new conditions of convergence are weaker. In addition, the attractive basins of the family with different parameters are studied, which can show the different stability of the family. Finally, in numerical experiments, the iterative method is used to solve different nonlinear models, including vertical stresses, civil engineering problem, blood rheology model, and so on. Theoretical results of convergence criteria are verified.

A new eighth-order Chebyshev-Halley type iteration is proposed for solving nonlinear equations and matrix sign function. Basins of attraction show that several special cases of the new method are globally convergent. It is analytically proven that the new method is asymptotically stable and the new method has the order of convergence eight as well. The effectiveness of the theoretical results are illustrated by numerical experiments. In numerical experiments, the new method is applied to a random matrix, Wilson matrix and continuous-time algebraic Riccati equation. Numerical results show that, compared with some well-known methods, the new method achieves the accuracy requirement in the minimum computing time and the minimum number of iterations.

On the basis of Wang's method, a new fourth-order method for finding a zero of a derivative was presented. Under the hypotheses that the third and fourth order derivatives of nonlinear function were bounded, the local convergence of a new fourth-order method was studied. The error estimate, the order of convergence, and uniqueness of the solution were also discussed. In particular, Herzberger's matrix method was used to obtain the convergence order of the new method to four. By comparing the new method with Wang's method and the same order method, numerical illustrations showed that the new method has a higher order of convergence and accuracy.

Ostrowski's iterative method is a classical method for solving systems of nonlinear equations. However, it is not stable enough. In order to obtain a more stable Ostrowski-type method, this paper presented a new family of fourth-order single-parameter Ostrowski-type methods for solving nonlinear systems. As a generalization of the Ostrowski's methods, the Ostrowski's methods are a special case of the new family. It was proved that the order of convergence of the new iterative family was always fourth-order when the parameters take any real number. Finally, the dynamical behavior of the family was briefly analyzed using real dynamical tools. The new iterative method can be applied to solve a wide range of nonlinear equations, and it was used in numerical experiments to solve the Hammerstein equation, boundary value problem, and nonlinear system. These numerical results supported the theoretical results.

In this paper, the semi-local convergence of the Cordero's sixth-order iterative method in Banach space was proved by the method of recursion relation. In the process of proving, the auxiliary sequence and three increasing scalar functions can be derived using Lipschitz conditions on the first-order derivatives. By using the properties of auxiliary sequence and scalar function, it was proved that the iterative sequence obtained by the iterative method was a Cauchy sequence, then the convergence radius was obtained and its uniqueness was proven. Compared with Cordero's process of proving convergence, this paper does not need to ensure that $\mathcal{G}(s)$ is continuously differentiable in higher order, and only the first-order Fréchet derivative was used to prove semi-local convergence. Finally, the numerical results showed that the recursion relationship is reasonable.

There are numerous applications for finding zero of derivatives in function optimization. In this paper, a two-step fourth-order method was presented for finding a zero of the derivative. In the research process of iterative methods, determining the ball of convergence was one of the important issues. This paper discussed the radii of the convergence ball, uniqueness of the solution, and the measurable error distances. In particular, in contrast to Wang's method under hypotheses up to the fourth derivative, the local convergence of the new method was only analyzed under hypotheses up to the second derivative, and the convergence order of the new method was increased to four. Furthermore, different radii of the convergence ball was determined according to different weaker hypotheses. Finally, the convergence criteria was verified by three numerical examples and the new method was compared with Wang's method and the same order method by numerical experiments. The experimental results showed that the convergence order of the new method is four and the new method has higher accuracy at the same cost, so the new method is finer.