On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation

In this article, we construct a family of iterative methods for finding a single root of nonlinear equation and then generalize this family of iterative methods for determining all roots of nonlinear equations simultaneously. Further we extend this family of root estimating methods for solving a system of nonlinear equations. Convergence analysis shows that the order of convergence is 3 in case of the single root finding method as well as for the system of nonlinear equations and is 5 for simultaneous determination of all distinct and multiple roots of a nonlinear equation. The computational cost, basin of attraction, efficiency, log of residual and numerical test examples show that the newly constructed methods are more efficient as compared to the existing methods in literature.


Introduction
To solve the nonlinear equation is the oldest problem of science in general and in mathematics in particular. These nonlinear equations have diverse applications in many areas of science and engineering. In general, to find the roots of (1), we look towards iterative schemes, which can be further classified as to approximate a single root and all roots of (1). There exists another class of iterative methods in literature which solves nonlinear systems. In this article, we are going to work on all these three types of iterative methods. A lot of iterative methods for finding roots of nonlinear equations and their system of different convergence order already exist in the literature (see [1][2][3][4][5][6][7][8][9][10][11][12]). The aforementioned methods are used to approximate one root at a time. But mathematician are also interested in finding all roots of (1) simultaneously. This is due to the fact that simultaneous iterative methods are very popular due to their wider region of convergence, are more stable as compared to single root finding methods, and implemented for parallel computing as well. More details on simultaneous determination of all roots can be found in [13][14][15][16][17][18][19][20][21][22][23][24][25] and the references cited therein.
The main aim of this paper to construct a family of optimal third order iterative methods and then convert them into simultaneous iterative methods for finding all distinct as well as multiple roots of nonlinear equation (1). We further extend this family of iterative methods for solving a system of nonlinear equations. Basins of attractions of single roots finding methods are also given to show the convergence behavior of iterative methods.

Constructions of a family of methods for single root and convergence analysis 3 Generalizations to simultaneous methods
Suppose that nonlinear equation (1) has n roots. Then f (x) and f (x) can be approximated as This implies . (13) This gives the Albert Ehrlich method [29] y (k+1) , (14) where N( and i, j = 1, 2, 3, . . . , n. Now from (13), an approximation of . (15) Using (15) in (14), we have . (16) In case of multiple roots, where ) and y (k) ). Thus, we get the following new family of simultaneous iterative methods for extracting all distinct as well as multiple roots of nonlinear equation (1) abbreviated as SM1. Zhang et al. [30] presented the following fifth order simultaneous methods:

Convergence analysis
In this section, the convergence analysis of a family of simultaneous methods (17) is given in a form of the following theorem. Obviously, convergence for method (17) will follow from the convergence of method (SM1) from theorem (2) when the multiplicities of the roots are simple.
be the errors in x (k) i and y (k+1) i approximations respectively. Considering (SM1), we have where Then, obviously, for distinct roots we have Thus, for multiple roots, we have from (17) where z (k) jζ j = 3 j from (3) and E i = ( ). Thus, . (29) If it is assumed that absolute values of all errors j (j = 1, 2, 3, . . .) are of the same order as, say | j | = O| |, then from (29) we have Hence the theorem.

Extension to a system of nonlinear equations
In this work, we consider the following system of nonlinear equations: where in F(x) = (f 1 (x), f 2 (x), . . . , f n (x)) T and the functions f 1 (x), f 2 (x), . . . , f n (x) are the coordinate functions of [31]. There are many approaches to solving nonlinear system (31). One of the famous iterative methods is Newton-Raphson method for solving the system of nonlinear equations . . .
Here, we present some well-known third order iterative methods for solving the system of nonlinear equations. Darvisti et al. [32] presented the following third order iterative method (Abbreviated as EE1): Trapezoidal Newton method [33] of third order was presented as follows (Abbreviated asEE2): Khirallah et al. [34] presented the following third order iterative method (Abbreviated as EE3): Here, we extend the family of iterative methods (2) for solving the system of nonlinear equations where α ∈ R. We abbreviate this family of iterative methods for approximating roots of the system of nonlinear equations by QQ1.

Theorem 3
Let the function F : E ⊆ R n → R n be sufficiently Fréchet differentiable on an open set E containing the root ζ of F(x (k) ) = 0. If the initial estimation x (0) is close to ζ , then the convergence order of the method QQ1 is at least three, provided that α ∈ R.
Proof Let e (k) = x (k)ζ , e~( k) = y (k)ζ , and e (k) = z (k)ζ be the errors in developing Taylor series of F(x (k) ) in the neighborhood of ζ assuming that F (r) -1 exists, we write and where Expanding F (y (k) ) about ζ and using (38), we obtain Using equations (37) and (39) in the second step of (33), we get Hence, it proves the theorem.

Complex dynamical study of families of iterative methods
Here, we discuss the dynamical study of iterative methods (Q1, E1-E6). We investigate the region from where we take the initial estimates to achieve the roots of nonlinear equation. Actually, we numerically approximate the domain of attractions of the roots as a qualitative measure, how the iterative methods depend on the choice of initial estimations. To answer these questions on the dynamical behavior of the iterative methods, we investigate the dynamics of method Q1 and compare it with E1-E6. For more details on the dynamical behavior of the iterative methods, one can consult [3,35,36]. Taking a rational function f : C − → C, where C denotes the complex plane, the orbit x 0 ∈ C defines a set such as An attracting point x 0 ∈ C defines the basin of attraction as the set of starting points whose orbit tends to x * . For the dynamical and graphically point of view, we take 2000 × 2000 grid of square [-2.5, 2.5] 2 ∈ C. To each root of (1), we assign a color to which the corresponding orbit of the iterative method starts and converges to a fixed point. Take color map as Jet and Hot respectively. We use |x i+1 -x i | < 10 -3 and |f (x i )| < 10 -3 as stopping criteria, and the maximum number of iterations is taken as 20. We mark a dark blue point when using stopping criteria |x i+1 -x i | < 10 -3 and dark black point when using |f (x i )| < 10 -3 . Different color is used for different roots. Iterative methods have different basins of attraction distinguished by their colors. We obtain basins of attractions for the following three test functions f 1 (x) = x 4ix 2 + 1, f 2 (x) = (1 + 2i)x 5 + 1 -2i, and f 3 (x) = x 6ix 3 + 1. The exact roots of f 1 (x), f 2 (x), and f 3 (x) are given in Table 1. Brightness in color means a lower number of iterations steps.

Numerical results
Here, some numerical examples are considered in order to demonstrate the performance of our family of one-step third order single root finding methods (Q1), fifth order simultaneous methods (SM1), and third order family of iterative methods for solving the nonlinear system of equations respectively. We compared our family of single root finding methods (Q1) with third order iterative methods (E1-E6). The family of simultaneous methods (SM1) of order five is compared with Zhang et al. method [30] of the same order (abbreviated as ZPH method). Iterative methods for finding roots of nonlinear system (QQ1) are compared with EE1-EE3 respectively. All the computations are performed using CAS Maple 18 with 2500 (64 digits floating point arithmetic in case of simultaneous methods) significant digits with stopping criteria as follows: where e i and e (k) represent the absolute error. We take ∈= 10 -600 for the single root finding method, ∈= 10 -30 for simultaneous determination of all roots of nonlinear equation (1), and ∈= 10 -15 for approximating roots of nonlinear system (31).
Numerical test examples from [32,34,37,38] are provided in Tables 2-8. In Table 3 stopping criterion (i) is used, in Table 2 stopping criteria (i) and (ii) both are used, while in Tables 4-8 stopping criteria (iii) and (iv) both are used. In all Tables CO represents the convergence order, n represents the number of iterations, ρ represents local computational order of convergence [39], and CPU represents computational time in seconds. We observe that numerical results of the family of iterative methods (in case of single Q1) as well as simultaneous determination (SM1 of all roots) and for approximating roots of system of nonlinear equations QQ1 are better than E1-E6, ZPH, and EE1-EE3 respectively on the same number of iterations.

Application in engineering
In this section, we discuss application in engineering.

Conclusion
We have developed here families of single root finding methods of convergence order three for a nonlinear equation as well as for a system of nonlinear equations and families of simultaneous methods of order five respectively. From Tables 2-8 and Figs. 1-5 and 6, we observe that our methods (Q1, SM1, and QQ1) are superior in terms of efficiency, stability, CPU time, and residual error as compared to the methods E1-E6, ZPH, and EE1-EE3 respectively.