- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Journal of Mathematics
Volume 2013 (2013), Article ID 404635, 3 pages
Introduction to Higher-Order Iterative Methods for Finding Multiple Roots of Nonlinear Equations
Padé Research Centre, 39 Deanswood Hill, Leeds, West Yorkshire LS17 5JS, UK
Received 28 September 2012; Accepted 19 November 2012
Academic Editor: Petr Ekel
Copyright © 2013 Rajinder Thukral. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We introduce two higher-order iterative methods for finding multiple zeros of nonlinear equations. Per iteration the new methods require three evaluations of function and one of its first derivatives. It is proved that the two methods have a convergence of order five or six.
Solving nonlinear equations is one of the most important problems in numerical analysis. In this paper, we consider iterative methods to find a multiple root of multiplicity , that is, , and , of a nonlinear equation where is a scalar function on an open interval and it is sufficiently smooth in a neighbourhood of . In recent years, some modifications of the Newton method for multiple roots have been proposed and analysed [1–8]. However, there are not many methods known to handle the case of multiple roots. Hence we present two higher-order methods for finding multiple zeros of a nonlinear equation and only use four evaluations of the function per iteration. In addition, the new methods have a better efficiency index than the third- and fourth-order methods given in [1–3, 7]; in view of this fact, the new methods are significantly better when compared with the established methods.
2. Development of the Methods and Convergence Analysis
In this section, we define new higher-order methods. In order to establish the order of convergence of the new methods we state the three essential definitions.
Definition 1. Let be a real function with a simple root , and let be a sequence of real numbers that converge towards . The order of convergence is given by where is the asymptotic error constant and .
Definition 2. Let be the number of function evaluations of the new method. The efficiency of the new method is measured by the concept of efficiency index [9, 10] and defined as where is the order of convergence of the method.
Definition 3. Kung-Traub conjectured that the multipoint iterative methods without memory, requiring function evaluations per iteration, have the order of convergence of at most Multipoint methods that satisfy the Kung-Traub conjecture are usually called optimal methods .
Recently, Thukral  presented a fourth-order iterative method, given by In fact, the new methods presented in this paper are the extension of the above scheme. To develop the higher-order methods, we use the above two steps and introduce the third step with a new parameter. First we define the sixth-order method and then followed by the fifth-order method.
2.1. New Sixth-Order Method
Theorem 4. Let be a multiple root of multiplicity of a sufficiently differentiable function for an open interval . If is sufficiently close to , then the order of convergence of the new method defined by (10) is six.
Proof. Let be a multiple root of multicity of a sufficiently smooth function, and , where is defined in (6).
Using the Taylor expansion of and about , we have where and From (6), we have The expansion of and about is given by By using (11) and (15), we have Since from (7) we have As before we expand , and substitute the appropriate expressions in (10). After simplification we obtain the error equation The error equation (18) establishes the sixth-order convergence of the new method defined by (10).
2.2. New Fifth-Order Method
Theorem 5. Let be a multiple root of multiplicity of a sufficiently differentiable function for an open interval . If is sufficiently close to , then the order of convergence of the new method defined by (21) is five.
Proof. Substituting appropriate expressions in (21) and after simplification, we obtain the error equation The error equation (22) establishes the fifth-order convergence of the new method defined by (21).
In this paper, we have introduced two new higher-order methods for solving nonlinear equations with multiple roots. Convergence analysis proves that the new methods preserve their order of convergence. The fifth-order method presented in this paper was actually the first improvement of the fourth-order method recently introduced in , and further improvement was made to achieve the sixth-order method. Simply by introducing new parameters we have achieved higher order of convergence. The purpose of this paper is to introduce higher order of convergence methods. Since we have verified the order of convergence of the new methods, we have not illustrated the numerical performance of these methods. Finally, we conjecture that these new higher-order iterative methods may be extended to an optimal eighth-order of convergence and may be considered a very good alternative to the classical methods given in [1–8].
The author is grateful to the reviewer for his helpful comments on this paper.
- S. Kumar, V. Kanwar, and S. Singh, “On some modified families of multipoint iterative methods for multiple roots of nonlinear equations,” Applied Mathematics and Computation, vol. 218, no. 14, pp. 7382–7394, 2012.
- S. G. Li, L. Z. Cheng, and B. Neta, “Some fourth-order nonlinear solvers with closed formulae for multiple roots,” Computers and Mathematics with Applications, vol. 59, no. 1, pp. 126–135, 2010.
- J. Peng and Z. Zeng, “An approach finding multiple roots of nonlinear equations or polynomials,” Advanced Research on Electronic Commerce, Web Application, and Communication, vol. 149, pp. 83–87, 2012.
- E. Schröder, “Ueber unendlich viele Algorithmen zur Auflösung der Gleichungen,” Mathematische Annalen, vol. 2, no. 2, pp. 317–365, 1870.
- J. R. Sharma and R. Sharma, “Modified Jarratt method for computing multiple roots,” Applied Mathematics and Computation, vol. 217, no. 2, pp. 878–881, 2010.
- L. Shengguo, L. Xiangke, and C. Lizhi, “A new fourth-order iterative method for finding multiple roots of nonlinear equations,” Applied Mathematics and Computation, vol. 215, no. 3, pp. 1288–1292, 2009.
- R. Thukral, “A new third-order iterative method for solving nonlinear equations with multiple roots,” International Journal of Mathematics and Computation, vol. 6, pp. 61–68, 2010.
- Rajinder Thukral, “New fourth-order nonlinear solver for multiple roots,” submitted in Advances in Numerical Analysis.
- W. Gautschi, Numerical Analysis: An Introduction, Birkhäuser, Boston, Mass, USA, 1997.
- J. F. Traub, Iterative Methods for Solution of Equations, Chelsea Publishing, New York, NY, USA, 1977.
- H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,” Journal of the Association for Computing Machinery, vol. 21, pp. 643–651, 1974.