×

A class of two-step Steffensen type methods with fourth-order convergence. (English) Zbl 1166.65338

Summary: Based on Steffensen’s method, we derive a one-parameter class of fourth-order methods for solving nonlinear equations. In the proposed methods, an interpolating polynomial is used to get a better approximation to the derivative of the given function. Each member of the class requires three evaluations of the given function per iteration. Therefore, this class of methods has efficiency index which equals 1.587. H. T. Kung and J. F. Traub conjectured an iteration using \(n\) evaluations of \(f\) or its derivatives without memory is of convergence order at most \(2n-1\) [J. Assoc. Comput. Mach. 21, 643–651 (1974; Zbl 0289.65023)]. The new class of fourth-order methods agrees with the conjecture of Kung-Traub for the case \(n=3\). Numerical comparisons are made to show the performance of the presented methods.

MSC:

65H05 Numerical computation of solutions to single equations

Citations:

Zbl 0289.65023
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ortega, J. M.; Rheinbolt, W. C., Iterative Solution of Nonlinear Equations in Several Variables (1970), Academic Press: Academic Press New York · Zbl 0241.65046
[2] Argyros, I. K., Convergence and Application of Newton-Type Iterations (2008), Springer Verlag Publ.: Springer Verlag Publ. New York
[3] Johnson, L. W.; Riess, R. D., Numerical Analysis (1977), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0257.65024
[4] Dehghan, M.; Hajarian, M., A variant of Steffensen’s method with a better approximation to the derivative, Appl. Math. Comput. (2008)
[5] Jain, P., Steffensen type methods for solving non-linear equations, Appl. Math. Comput., 194, 527-533 (2007) · Zbl 1193.65063
[6] Sharma, J. R., A composite third order Newton-Steffensen method for solving nonlinear equations, Appl. Math. Comput., 169, 242-246 (2005) · Zbl 1084.65054
[7] Amat, S.; Busquier, S., Convergence and numerical analysis of a family of two-step steffensen’s methods, Comput. Math. Appl., 49, 13-22 (2005) · Zbl 1075.65080
[8] Amat, S.; Busquier, S., A two-step Steffensen’s method under modified convergence conditions, J. Math. Anal. Appl., 324, 1084-1092 (2006) · Zbl 1103.65060
[9] Amat, S.; Busquier, S., On a Steffensen’s type method and its behavior for semismooth equations, Appl. Math. Comput., 177, 819-823 (2006) · Zbl 1096.65047
[10] Alarcn, V.; Amat, S.; Busquier, S.; Lpez, D. J., A Steffensen’s type method in Banach spaces with applications on boundary-value problems, J. Comput. Appl. Math., 216, 243-250 (2008) · Zbl 1139.65040
[11] Gautschi, W., Numerical Analysis: An Introduction (1997), Birkhãuser · Zbl 0877.65001
[12] Bi, W.; Ren, H.; Wu, Q., New family of seventh-order methods for nonlinear equations, Appl. Math. Comput., 203, 408-412 (2008) · Zbl 1154.65323
[13] Xu, L.; Wang, X., Topics on Methods and Examples of Mathematical Analysis (in Chinese) (1983), High Education Press
[14] Kung, H. T.; Traub, J. F., Optimal order of one-point and multipoint iteration, J. Assoc. Comput. Math., 21, 634-651 (1974) · Zbl 0289.65023
[15] Weerakoon, S.; Fernando, T. G.I., A variant of Newton’s method with accelerated third-order convergence, Appl. Math. Lett., 13, 87-93 (2000) · Zbl 0973.65037
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.