×

Improvements of the efficiency of some three-step iterative like-Newton methods. (English) Zbl 1123.65037

To solve iteratively a nonlinear equation, the classical Newton method can be improved from the viewpoint of convergence order and efficiency. This can be made by an additional evaluation of the function appearing in the left hand side of the equation, an additional evaluation of the first derivative, or by changing the points of evaluation.
The author discusses some new three-step iterative methods obtained from a two-step variant of Newton’s method, where the last evaluation of the derivative is replaced by a linear combination of evaluations of the functions previously computed. The new iterative methods are of third and fourth order of convergence and it seems that they work better than the known variants of Newton’s method in terms of order and of computational efficiency for multi-precision arithmetic. Numerical experiments and comparisons are performed for seven concrete equations.

MSC:

65H05 Numerical computation of solutions to single equations
Full Text: DOI

References:

[1] Amat S., Busquier S., Plaza S. (2005). Dynamics of the King and Jarrat iterations. Aequationes Math. 69: 212–223 · Zbl 1068.30019 · doi:10.1007/s00010-004-2733-y
[2] Chun C. (2006). A new iterative method for solving nonlinear equations. Appl. Math. Comput. 178: 415–422 · Zbl 1105.65057
[3] Chun C. (2006). Construction of Newton-like iteration methods for solving nonlinear equations. Numer. Math. 104: 297–315 · Zbl 1126.65042 · doi:10.1007/s00211-006-0025-2
[4] Chun, C.: A family of composite fourth oredr iterative methods for solving nonlinear equations. Appl. Math. Comput. doi:10.1016/j.amc.2006.09.009 (2006)
[5] Gautschi W. (1997). Numerical Analysis. An Introduction. Birkhäuser Boston, Inc., Boston · Zbl 0877.65001
[6] Grau M. (2003). An improvement to the computing of nonlinear equation solutions. Numer. Algorithms 34: 1–12 · Zbl 1043.65071 · doi:10.1023/A:1026100500306
[7] Grau M., Noguera M. (2004). A variant of Cauchy’s method with accelerated fifth-order convergence. Appl. Math. Lett. 17: 509–517 · Zbl 1070.65034 · doi:10.1016/S0893-9659(04)90119-X
[8] Grau M., Díaz-Barrero J.L. (2006). An improvement of the Euler–Chebyshev iterative method. J. Math. Anal. Appl. 315: 1–7 · Zbl 1113.65048 · doi:10.1016/j.jmaa.2005.09.086
[9] Grau M., Díaz-Barrero J.L. (2006). An improvement to Ostrowski root-finding method. Appl. Math. Comput. 173: 450–456 · Zbl 1090.65053 · doi:10.1016/j.amc.2005.04.043
[10] Grau-Sánchez M., Díaz-Barrero J.L. (2006). On computational efficiency for multi-precision zero-finding methods. Appl. Math. Comput. 181: 402–412 · Zbl 1148.65033 · doi:10.1016/j.amc.2005.12.060
[11] Grau-Sánchez, M., Díaz-Barrero, J.L.: A weighted variant family of Newton’s method with accelerated third-order convergence. Appl. Math. Comput. doi:10.1016/j.amc.2006.08.041 (2006) · Zbl 1121.65050
[12] King R.F. (1973). A family of fourth-order methods for nonlinear equations. SIAM J. Numer. Anal. 10: 876–879 · Zbl 0266.65040 · doi:10.1137/0710072
[13] Kou, J.S., Li, Y.T.: A variant of Jarrat’s method with accelerated sixth-order convergence. Int. J. Comput. Math. (in press) (2006) · Zbl 1125.65042
[14] Kou, J.S., Li, Y.T., Wang, X.H.: A family of fifth-order iterations composed of Newton and third-order methods. Appl. Math. Comput. doi:10.1016/j.amc.2006.07.150 (2006) · Zbl 1119.65037
[15] Kou, J.S., Li, Y.T., Wang, X.H.: A composite fourth-order iterative method for solving nonlinear equations. Appl. Math. Comput. doi:10.1016/j.amc.2006.05.181 (2006) · Zbl 1114.65045
[16] Kou, J.S., Li, Y.T., Wang, X.H.: Some variants of Ostrowski’s method with seventh-order convergence. J. Comput. Appl. Math. doi:10.1016/j.cam.2006.10.073 (2006) · Zbl 1130.41006
[17] Ostrowski A.M. (1960). Solutions of Equations and System of Equations. Academic, New York · Zbl 0115.11201
[18] Ralston A. (1965). A First Course in Numerical Analysis. McGraw–Hill, New York · Zbl 0139.31603
[19] Traub J.F. (1964). Iterative Methods for the Solution of Equations. Prentice–Hall, Englewood Cliffs · Zbl 0121.11204
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.