Modified Jarratt method for computing multiple roots. (English) Zbl 1203.65084

Construction of iterative methods of optimal order for multiple roots is a difficult problem in numerical analysis. A fourth order method for computing multiple roots of nonlinear equations \((f(x)=0)\) is presented. The method is based on the Jarratt scheme for simple roots. The method is optimal, since it requires three evaluations per step. The efficacy is tested on the a number of relevant numerical problems.


65H05 Numerical computation of solutions to single equations


Full Text: DOI


[1] Kung, H. T.; Traub, J. F., Optimal order of one-point and multipoint iteration, J. Assoc. Comput. Mach., 21, 643-651 (1974) · Zbl 0289.65023
[2] Petković, M. S., On a class of multipoint root-finding methods of high computational efficiency, SIAM J. Numer. Anal., 47, 4402-4414 (2010) · Zbl 1209.65053
[3] Traub, J. F., Iterative Methods for the Solution of Equations (1964), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0121.11204
[4] Jarratt, P., Some efficient fourth order multipoint methods for solving equations, BIT, 9, 119-124 (1969) · Zbl 0188.22101
[5] Wolfram, S., The Mathematica Book (2003), Wolfram Media
[6] Gautschi, W., Numerical Analysis: An Introduction (1997), Birkhäuser: Birkhäuser Boston, MA · Zbl 0877.65001
[7] Li, S.; Liao, X.; Cheng, L., A new fourth-order iterative method for finding multiple roots of nonlinear equations, Appl. Math. Comput., 215, 1288-1292 (2009) · Zbl 1175.65054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.