Some Families of Two-Step Simultaneous Methods for Determining Zeros of Nonlinear Equations
Nazir Ahmad Mir,1,2,3Rifka Muneer,1,2,3and Iffat Jabeen1,2,3
Academic Editor: K. Karamanos, M. Sun, X. Wen
Received11 Mar 2011
Accepted09 Apr 2011
Published05 May 2011
Abstract
We construct two families of two-step simultaneous methods, one of order four and the other of order six, for determining all the distinct zeros of single variable nonlinear equations. The convergence analysis of both the families of methods and the numerical results are also given in order to demonstrate the efficiency and the performance of the new iterative simultaneous methods.
1. Introduction
Determining the zeros of non-linear equations is among the oldest problems in mathematics, whereas the non-linear equations have wide range of applications in science and engineering.
There are numerical methods which find one root at a time, such as Newton's method, and the methods which find all the roots at a time, namely, simultaneous methods, such as Weierstrass method.
The methods for simultaneous finding of all roots of the non-linear equations are very popular as compared to the methods for individual finding of the roots. These methods have a wider region of convergence, are more stable, and can be implemented for parallel computing. More details on simultaneous methods, their convergence properties, computational efficiency, and parallel implementation may be found in [1β5] and references cited therein.
The main goal of this paper is to develop simultaneous methods which have high convergence order and computational efficiency.
2. A Family of Two-Step Fourth-Order Simultaneous Methods for Distinct Roots
In this section, we develop a family of new two-step iterative methods for the simultaneous approximation of all zeros of a non-linear equation using Weierstrassβ correction.
There exist many one-step iterative methods for extracting roots of non-linear equations. We consider the following two-step alpha family:
where is any arbitrary real parameter. This family was proposed by Li et al. [6] and has fourth-order convergence. If , then (2.1) reduces to the following iterative method:
This is a well-known two-step Newton's method presented and considered by Traub [7] and has a fourth-order convergence.
Let
Equation (2.1) can be written as
Replacing by in (2.4), we get
where and are given by (2.3).
Hence, we get a family of new two-step iterative methods (2.5) abbreviated as MR1, which depends upon a real parameter alpha for extracting all roots of a non-linear equation.
Remark 2.1. Two-step Weierstrassβ method is a special case of our family of methods if , in (2.5).
3. Convergence Analysis
In this section, we prove the following theorem on the convergence order of family of two-step simultaneous methods (2.5).
Theorem 3.1. Let be a non-linear equation with n number of simple roots . If are the initial approximations of the roots, respectively, then, for arbitrary and sufficiently close initial approximations, the order of convergence of (2.5) equals four.
Proof. We denote, , , and . Considering the first equation of (2.5),
we have that
where
Now, if is a simple root, then, for small enough , is bounded away from zero, and so
This implies that
Hence,
Thus, (3.2) gives
Now, considering second equation of (2.5), we have that
where
With the same arguments as in (3.2), we have that
Now,
Using (3.9), this implies that
Hence, (3.8) gives
Now, and . Thus
which proves the theorem.
4. A Family of Two-Step Sixth-Order Simultaneous Methods for Distinct Roots
Here, we develop a new family of two-step simultaneous iterative methods of order six using the same alpha family (2.1).
Consider
Taking logarithmic derivatives of (4.2), we have that
Replacing by in (2.4), we have that
Using (4.1) and (4.3) in the above, we have that
Thus, we get a family of new simultaneous iterative methods (4.5), abbreviated as MR2.
Remark 4.1. Two-step Ehrlich-Alberthβs method is a special case of our method, if in (4.5).
5. Convergence Analysis
Here, we prove the following theorem on the convergence order of a family of two-step simultaneous methods (4.5).
Theorem 5.1. Letβ be a non-linear equation with n number of simple roots . If are the initial approximations of the roots, respectively, then, for arbitrary and sufficiently close initial approximations, the order of convergence of family (4.5) is six.
Proof. Consider the Newton correction
This implies that
where is the exact root and is its approximation. This gives
Using (5.3) in (4.5), we have that
Let
Thus, from (5.4), we have that
where
On simplification, we have that
If we assume that absolute values of all errors are of the same order as, say , then
Now considering the second equation of (4.5), we have that
This gives
This implies that
Let
Hence, the above equation becomes
On simplification, we have that
Since , from (5.9),
This shows that our family of two-step simultaneous methods (4.5) has sixth-order convergence.
6. Numerical Results
We consider here some numerical examples in order to demonstrate the performance of our family of fourth- and sixth-order two-step simultaneous methods, namely MR1 (2.5) and MR2 (4.5). We compare our family of methods with Zhang et al. method of fifth-order convergence and use the abbreviations as ZPH [8].
All the computations are performed using Maple 7.0, using 64 digits floating point arithmetic. We take as tolerance and use the following stopping criteria for estimating the zeros:
and represents the absolute error.
In all the examples for MR1 and MR2, we have taken .
Example 6.1. Consider
with the exact zeros
The initial approximations have been taken as:
The numerical comparison is given in Table 1.
Example 6.2. Consider
with the exact zeros
The initial approximations have been taken as
The numerical comparison is shown in Table 2.
Example 6.3. Consider
with the exact zeros
The initial approximations have been taken as:
The numerical comparision is shown in Table 3.
7. Conclusions
We have developed here two families of two-step simultaneous iterative methods of order four and six for determination of all the distinct zeros of non-linear equations. Weierstrassβ two-step and Ehrlich-Alberthβs two-step simultaneous methods are special cases of our family of methods. From Tables 1β3, we observe that our methods are very effective and efficient as compared to fifth-order simultaneous method of Zhang et al. [8]. Our results can be considered as an improvement and generalization of the previously known results in the existing literature.
References
M. Cosnard and P. Fraigniaud, βFinding the roots of a polynomial on an MIMD multicomputer,β Parallel Computing, vol. 15, no. 1β3, pp. 75β85, 1990.
S. Kanno, N. V. Kjurkchiev, and T. Yamamoto, βOn some methods for the simultaneous determination of polynomial zeros,β Japan Journal of Industrial and Applied Mathematics, vol. 13, no. 2, pp. 267β288, 1996.
M. PetkoviΔ, Iterative Methods for Simultaneous Inclusion of Polynomial Zeros, vol. 1387 of Lecture Notes in Mathematics, Springer, Berlin, Germany, 1989.
M. S. PetkoviΔ, D. Herceg, and S. M. IliΔ, Point Estimation Theory and Its Applications, University of Novi Sad Institute of Mathematics, Novi Sad, Yugoslavia, 1997.
B. Sendov, A. Andreev, and N. Kjurkchiev, Numerical Solution of Polynomial Equations, Elsevier Science, New York, NY, USA, 1994.
T.-F. Li, D.-S. Li, Z.-D. Xu, and Y.-l. Fang, βNew iterative methods for non-linear equations,β Applied Mathematics and Computation, vol. 197, no. 2, pp. 755β759, 2008.
J. F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Englewood Cliffs, NJ, USA, 1964.
X. Zhang, H. Peng, and G. Hu, βA high order iteration formula for the simultaneous inclusion of polynomial zeros,β Applied Mathematics and Computation, vol. 179, no. 2, pp. 545β552, 2006.