Abstract
A one-parameter family of derivative free multipoint iterative methods of orders three and four are derived for finding the simple and multiple roots off(x)=0. For simple roots, the third order methods require three function evaluations while the fourth order methods require four function evaluations. For multiple roots, the third order methods require six function evaluations while the fourth order methods require eight function evaluations. Numerical results show the robustness of these methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. O. Espelid,On the behaviour of the secant method near a multiple root, BIT 11 (1972), 112–115.
H. Esser,Eine stets quadratisch konvergente Modifikation des Steffensen-Verfahrens, Computing 14 (1975), 367–369.
R. F. King,A secant method for multiple roots, BIT 17 (1977), 321–328.
J. B. Kioustelidis,A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros, Numer. Math. 33 (1979), 385–389.
G. W. Stewart,The convergence of multipoint iterations to multiple zeros, SIAM J. Numer. Anal. 11 (1974), 1105–1120.
G. W. Stewart,The behaviour of a multiplicity independent root-finding scheme in the presence of error, BIT 20 (1980), 526–528.
J. F. Traub,Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, N.J. (1964).
D. Woodhouse,A note on the secant method, BIT 15 (1975), 323–327.
H. Woźniakowski,Numerical stability for solving nonlinear equations, Numer. Math. 27 (1977), 373–390.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iyengar, S.R.K., Jain, R.K. Derivative free multipoint iterative methods for simple and multiple roots. BIT 26, 93–99 (1986). https://doi.org/10.1007/BF01939365
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01939365